WEA 2005 - PDF Preprint Papers

WEA 2005 International Workshop on Experimental and E cient Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WEA-2005 Paper

click to vote

WEA
2005
Springer

294views Algorithms» more WEA 2005»

Partitioning Graphs to Speed Up Dijkstra's Algorithm

13 years 10 months ago

Download www.math.tu-berlin.de

Rolf H. Möhring, Heiko Schilling, Birk Sch&uu...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	294	Partitioning Graphs to Speed Up Dijkstra's Algorithm	claim
2	194	Acceleration of Shortest Path and Constrained Shortest Path Computation	claim
3	176	High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology	claim
4	154	Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs	claim
5	138	A Practical Minimal Perfect Hashing Method	claim
6	131	Algorithm Engineering for Optimal Graph Bipartization	claim
7	120	Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms	claim
8	119	On Symbolic Scheduling Independent Tasks with Restricted Execution Times	claim
9	117	Vertex Cover Approximations: Experiments and Observations	claim
10	109	Synchronization Fault Cryptanalysis for Breaking A5/1	claim
11	107	Local Clustering of Large Graphs by Approximate Fiedler Vectors	claim
12	105	Inferring AS Relationships: Dead End or Lively Beginning?	claim
13	100	Rounding to an Integral Program	claim
14	99	Degree-Based Treewidth Lower Bounds	claim
15	98	Implementing Minimum Cycle Basis Algorithms	claim
16	97	Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces	claim
17	93	From Static Code Distribution to More Shrinkage for the Multiterminal Cut	claim
18	91	Rectangle Covers Revisited Computationally	claim
19	91	The Necessity of Timekeeping in Adversarial Queueing	claim
20	90	A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables	claim
21	89	Don't Compare Averages	claim
22	89	Implementation of Approximation Algorithms for the Multicast Congestion Problem	claim
23	88	New Upper Bound Heuristics for Treewidth	claim
24	86	Optimal Competitive Online Ray Search with an Error-Prone Robot	claim
25	85	BDDs in a Branch and Cut Framework	claim
26	81	GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem	claim
27	77	A General Buffer Scheme for the Windows Scheduling Problem	claim
28	75	New Bit-Parallel Indel-Distance Algorithm	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers