Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition

Author: Cohen E.  

Publisher: Academic Press

ISSN: 0196-6774

Source: Journal of Algorithms, Vol.21, Iss.2, 1996-09, pp. : 331-357

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