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

Author： Kavvadias D.J.   Pantziou G.E.   Spirakis P.G.   Zaroliagis C.D.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

Abstract

Related content

On Bounded Leg Shortest Paths Problems

By Roditty Liam   Segal Michael  

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

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

Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms

By Chaudhuri S.   Zaroliagis C.D.  

Theoretical Computer Science, Vol. 203, Iss. 2, 1998-08 ,pp. : 205-223

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

Preconditioning by Projectors in the Solution of Contact Problems: A Parallel Implementation

By Dostál Z.  

Annals of Operations Research, Vol. 117, Iss. 1-4, 2002-11 ,pp. : 117-129

Springer Publishing Company

Access to resources Recommend Favorite