Reconstructing edge-disjoint paths

Author： Conforti M.   Hassin R.   Ravi R.  

Publisher： Elsevier

ISSN： 0167-6377

Source： Operations Research Letters, Vol.31, Iss.4, 2003-07, pp. : 273-276

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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. : 121-138

Academic Press

Access to resources Recommend Favorite

Edge‐disjoint Hamilton cycles in random graphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. : 397-445

John Wiley & Sons Inc

Access to resources Recommend Favorite

Edge‐Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs

By  

JOURNAL OF GRAPH THEORY, Vol. 81, Iss. 1, 2016-01 ,pp. : 16-29

John Wiley & Sons Inc

Access to resources Recommend Favorite

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes

By Hromkovic J.   Klasing R.   Unger W.   Wagener H.  

Information and Computation, Vol. 133, Iss. 1, 1997-02 ,pp. : 1-33

Academic Press

Access to resources Recommend Favorite

Routing and wavelength assignment in optical WDM networks with maximum quantity of edge disjoint paths

By Choo Hyunseung   Shakhov Vladimir   Mukherjee Biswanath  

Photonic Network Communications, Vol. 12, Iss. 2, 2006-09 ,pp. : 145-152

Springer Publishing Company

Access to resources Recommend Favorite