On Bounded Leg Shortest Paths Problems

ISSN： 0178-4617

Source： Algorithmica, Vol.59, Iss.4, 2011-04, pp. : 583-600

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

Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems

By Kavvadias D.J. Pantziou G.E. Spirakis P.G. Zaroliagis C.D.

Theoretical Computer Science, Vol. 168, Iss. 1, 1996-11 ,pp. : 121-154

Elsevier

Access to resources Recommend Favorite

On the Complexity of Time-Dependent Shortest Paths

By Foschini Luca Hershberger John Suri Subhash

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 1075-1097

Springer Publishing Company

Access to resources Recommend Favorite

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

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