MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "All Pairs Shortest Paths in Sparse Graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 4 documents found, showing 1 through 4.
ATOM RSS
  • Community-Aware Mobile Networking  
  • by Michael Kuhn, Roger Wattenhofer — 2006 — In 1st Workshop on Mobile Services and Personalized Environments (MSPE
  • …. Unfortunately, the time complexity for all-pairs shortest paths on sparse graphs is O(N 2 log N + NM), which…
  • Cited by 1 (0 self) – Add To MetaCart
  • Segmentation Informed by Manifold Learning  
  • by Qilong Zhang Richard, Richard Souvenir, Robert Pless
  • …-wise distance matrix is calculated by solving for the all-pairs shortest paths in this sparse graph. Finally…
  • Add To MetaCart
  • On a conjecture on wiener indices in combinatorial chemistry  
  • by Yih-en Andrew Ban, Sergey Beregý, Nabil H. Mustafa — 2004 — Proc. of the 9th International Computing and Combinatorics Conference ’03 , 2003
  • … pairs shortest paths on sparse graphs to find�Ù�Úfor allÙ�ÚÎin timeÇ�Î�ÐÓ��Î�����Î�(using Fibonacci…
  • Cited by 1 (0 self) – Add To MetaCart
Help! Showing 1 through 4.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB