A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths

ISSN： 0178-4617

Source： Algorithmica, Vol.46, Iss.2, 2006-10, pp. : 181-192

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

By Banerjee S. Ghosh R.K. Reddy A.P.K.

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 165-171

Academic Press

Access to resources Recommend Favorite

A Branch-Checking Algorithm for All-Pairs Shortest Paths

By Duin Cees

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 131-145

Springer Publishing Company

Access to resources Recommend Favorite

Computing all-pairs shortest paths on a linear systolic array and hardware realization on a reprogrammable FPGA platform

By Milovanović E. Milovanović I. Bekakos M. Tselepis I.

The Journal of Supercomputing, Vol. 40, Iss. 1, 2007-04 ,pp. : 49-66

Springer Publishing Company

Access to resources Recommend Favorite

An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs

By Xie Minzhu Wang Jianxin

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 250-266

Springer Publishing Company

Access to resources Recommend Favorite

A fully dynamic algorithm for distributed shortest paths

By Cicerone S. Di Stefano G. Frigioni D. Nanni U.

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 83-102

Elsevier

Access to resources Recommend Favorite