Searching for "An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs." – 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.

An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs
by Sairam Subramanian, Sairam Subramanian, Roberto Tamassia, Roberto Tamassia, Jeffrey Scott Vitter, Jeffrey Scott Vitter — 1995 — Algorithmica
…CS--1993--30 An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs Sairam…
Cited by 1 (0 self) – Add To MetaCart

Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs
by Sairam Subramanian, Sairam Subramanian, Philip N. Klein, Roberto Tamassia, Jeffrey S. Vitter — 1995
… graph : : : 102 5 An efficient parallel algorithm for shortest paths in planar layered digraphs 108 5…
Add To MetaCart

Showing 1 through 2.

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