Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

92

Voted

RANDOM
1997
Springer

88views Theoretical Computer Science» more RANDOM 1997»

Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model

15 years 6 months ago

Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model

Download www.mpi-inf.mpg.de

Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volke

Real-time Traffic

RANDOM 1997 | Theoretical Computer Science |

claim paper

Related Content

» On Distributed TimeDependent Shortest Paths over DutyCycled Wireless Sensor Networks

» A Shortest PathBased Approach to the Multileaf Collimator Sequencing Problem

» Counterexamples in Probabilistic Model Checking

» ExpansionBased Algorithms for Finding Single Pair Shortest Path on Surface

» ShortestPath Kernels on Graphs

» Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D

» Quantum Query Complexity of Some Graph Problems

» Simplest Paths Automated Route Selection for Navigation

» Experimental Comparison of Shortest Path Approaches for Timetable Information

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	RANDOM
Authors	Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe

Comments (0)