Sciweavers

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

73

SODA
2010
ACM

favoriteEmaildiscussreport

152views Algorithms» more SODA 2010»

Solving the Replacement Paths Problem for Planar Directed Graphs in O(n*log n) Time

15 years 8 months ago

Solving the Replacement Paths Problem for Planar Directed Graphs in O(n*log n) Time

Download diku.dk

Christian Wulff-Nilsen

Real-time Traffic

Discrete Algorithms | Planar Directed Graphs | SODA 2010 |

claim paper

Related Content

» On the Exponent of the All Pairs Shortest Path Problem

» Beyond Bidimensionality Parameterized Subexponential Algorithms on Directed Graphs

» Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints

» Maximum Flows and Parametric Shortest Paths in Planar Graphs

» Finding Steiner Forests in Planar Graphs

» LinearTime Algorithms for Geometric Graphs with Sublinearly Many Crossings

» Simplest Paths Automated Route Selection for Navigation

» SpaceEfficient Algorithms for Reachability in SurfaceEmbedded Graphs

» Minimum time point assignment for coverage by two constrained robots

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Christian Wulff-Nilsen

Comments (0)