Author： Steiner G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.290, Iss.3, 2003-01, pp. : 2147-2155
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
Access to resources
Recommend
Improved shortest path algorithms for nearly acyclic graphs
Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. :
Optimal parallel algorithms for path problems on planar graphs
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Shortest path algorithms for nearly acyclic directed graphs
By Takaoka T.
Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. :
Optimal path cover problem on block graphs
By Wong P.-K.
Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. :