Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
16
click to vote
STOC
1994
ACM
favorite
Email
discuss
report
88
views
Algorithms
»
more
STOC 1994
»
Faster shortest-path algorithms for planar graphs
13 years 11 months ago
Download
www.cs.brown.edu
Philip N. Klein, Satish Rao, Monika Rauch Henzinge
Real-time Traffic
Algorithms
|
STOC 1994
|
claim paper
Related Content
»
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
»
Efficient Shape Matching Via Graph Cuts
»
Maximum Flows and Parametric Shortest Paths in Planar Graphs
»
Faster Algorithms for Allpairs Approximate Shortest Paths in Undirected Graphs
»
Fast Matching of Planar Shapes in Subcubic Runtime
»
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
»
MultipleSource Shortest Paths in Embedded Graphs
»
An External Memory Data Structure for Shortest Path Queries
»
External Data Structures for Shortest Path Queries on Planar Digraphs
»
Dynamic Multilevel Overlay Graphs for Shortest Paths
more »
Post Info
More Details (n/a)
Added
10 Aug 2010
Updated
10 Aug 2010
Type
Conference
Year
1994
Where
STOC
Authors
Philip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision