Searching for "Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights An Experimental Study." – 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.

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
by Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-spaccamela, Umberto Nanni — 2000 — In Proc. Workshop on Algorithm Engineering
…Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study ? Camil…
Cited by 10 (2 self) – Add To MetaCart

Showing 1 through 1.

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