Author： Hromkovic J. Klasing R. Unger W. Wagener H.
Publisher： Academic Press
ISSN： 0890-5401
Source： Information and Computation, Vol.133, Iss.1, 1997-02, pp. : 1-33
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
Reconstructing edge-disjoint paths
By Conforti M. Hassin R. Ravi R.
Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. :
Access to resources
Recommend
Edge‐disjoint Hamilton cycles in random graphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. :
Edge‐Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
JOURNAL OF GRAPH THEORY, Vol. 81, Iss. 1, 2016-01 ,pp. :
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time
By Weihe K.
Journal of Algorithms, Vol. 23, Iss. 1, 1997-04 ,pp. :
By V. N. Sastry T. N. Janakiraman S. Ismail Mohideen
International Journal of Computer Mathematics, Vol. 82, Iss. 3, 2005-03 ,pp. :