Searching for "On the all-pairs shortest-path algorithm of Moffat and Takaoka." – sorted by Relevance.

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

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

1 documents found, showing 1 through 1.

Constructing interference-minimal networks
by Marc Benkert, Joachim Gudmundsson, Herman Haverkort, Alexander Wolff — 2006 — In Proceedings 32nd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), volume 3831 of Lecture Notes in Computer Science
… of every edge to be 1), or in O(n 2 log n) expected time with the all-pairs-shortest-paths algorithm…
Cited by 5 (1 self) – Add To MetaCart

Showing 1 through 1.

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