Publisher： John Wiley & Sons Inc
E-ISSN： 1097-0037|66|2|136-144
ISSN： 0028-3045
Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.66, Iss.2, 2015-09, pp. : 136-144
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
Partitioning a graph into vertex-disjoint paths
Studia Scientiarum Mathematicarum Hungarica, Vol. 42, Iss. 3, 2005-08 ,pp. :
Access to resources
Recommend
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. :
Reconstructing edge-disjoint paths
By Conforti M. Hassin R. Ravi R.
Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. :
Studia Scientiarum Mathematicarum Hungarica, Vol. 38, Iss. 1-4, 2001-12 ,pp. :