Searching for "A near-linear time algorithm for computing replacement paths in planar directed graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

A near-linear time algorithm for computing replacement paths in planar directed graphs
by Yuval Emek, David Peleg, Liam Roditty — 2008 — In Proc. 19th annual ACM-SIAM symposium on Discrete algorithms
…A Near-Linear Time Algorithm for Computing Replacement Paths in Planar Directed Graphs Yuval Emek…
Cited by 2 (1 self) – Add To MetaCart

Submitted
by David Peleg, Liam Roditty, Timothy Chan, Mihai Patrascu, Liam Roditty, Liam Roditty, Asaf Shapira — 2008
… error Submitted 5. Yuval Emek, David Peleg and Liam Roditty A near-linear time algorithm for computing…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB