Reconstructing edge-disjoint paths

Operations Research Letters

Volumn 31, Issue 4, 2003, Pages 273-276

  Conforti, M ^a   Hassin, R ^b   Ravi, R ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b TEL AVIV UNIVERSITY   (Israel)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Flow equivalent tree; Stable matching

Indexed keywords

DATA STRUCTURES; FUNCTIONS; OPERATIONS RESEARCH;

WEIGHTED SPANNING TREES;

TREES (MATHEMATICS);

EID: 0037904394     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00022-1     Document Type: Article

References (6)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms and Applications. 1993;Prentice-Hall, Englewood Cliffs, NJ.
2. Chazelle B. Computing on free trees via complexity-preserving mappings. Algorithmica. 2:1987;337-361.
3. Gale D., Shapley L.S. College admissions and the stability of marriage. Am. Math. Monthly. 69:1962;9-15.
4. Gomory R.E., Hu T.C. Multi-terminal network flows. SIAM J. Appl. Math. 9:1961;551-556.
5. Gusfield D., Irving R.W. The Stable Marriage Problem: Structure and Algorithms. 1989;The MIT Press, Cambridge, MA.
6. D.R. Karger, M.S. Levine, Finding maximum flows in undirected graphs seems easier than bipartite matching, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 69-78.