Author： Weihe K.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.23, Iss.1, 1997-04, pp. : 121-138
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. :
Selecting vertex disjoint paths in plane graphs
NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 2, 2015-09 ,pp. :
Exploring Unknown Undirected Graphs
Journal of Algorithms, Vol. 33, Iss. 2, 1999-11 ,pp. :