Author： Chen Z.-Z.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.230, Iss.1, 2000-01, pp. : 75-95
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. :
Efficient parallel algorithms for doubly convex-bipartite graphs
Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. :
Finite-dimensional T-colorings of graphs
By Yeh
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :