Author： Hribar M.R. Taylor V.E. Boyce D.E.
Publisher： Academic Press
ISSN： 0743-7315
Source： Journal of Parallel and Distributed Computing, Vol.55, Iss.2, 1998-12, pp. : 153-165
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Improved shortest path algorithms for nearly acyclic graphs
Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. :
Access to resources
Recommend
Shortest path algorithms for nearly acyclic directed graphs
By Takaoka T.
Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. :
A family of optimal termination detection algorithms
By Mittal Neeraj Venkatesan S. Peri Sathya
Distributed Computing, Vol. 20, Iss. 2, 2007-08 ,pp. :