Length-Constrained Path-Matchings in Graphs

Networks

Volumn 39, Issue 4, 2002, Pages 210-215

  Ghodsi, M ^a   Hajiaghayi, M T ^b   Mahdian, M ^b   Mirrokni, V S ^b  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Matching; NP completeness; Path matching; Pseudo matching

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; MULTICASTING;

PATH MATCHING;

GRAPH THEORY;

EID: 0141763819     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10030     Document Type: Article

References (14)

1. J. Cohen and P. Fraigniaud, Broadcasting and multicasting in trees, Technical Report LRI-1265, Labratorie de Recherche en Informatique, University Paris-Sud, 91405 Orsay cedex, France, 2000.
2. J. Cohen, P. Fraigniaud, J.C. Koing, and A. Raspaud, Optimized broadcasting and multicasting protocols in cut-through routed networks, IEEE Trans Parallel Distrib Syst 9 (1998), 788-802.
3. L. Csaba, R.J. Faudree, A. Gyárfás, J. Lehel, and R.H. Schelp, Networks communicating for each pairing or terminals, Networks 22 (1992), 615-626.
4. W.H. Cunningham, and J.F. Geelen, The optimal path-matching problems, Combinatorica 17 (1997), 315-337.
5. A.K. Datta, and R.K. Sen, 1-Approximation algorithm for bottleneck disjoint path matching, Info Process Lett 55 (1995), 41-44.
6. A.M. Farley, Minimum-time line broadcast networks, Networks 10 (1980), 59-70.
7. R.J. Faudree, and A. Gyárfás, Path-matchings in graphs, Cong Num 120 (1996), 83-96.
8. M.R. Garey, and D.S. Johnson, Computers and intractability, A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
9. A. Itai, Y. Perl, and Y. Shiloach, The complexity of finding maximum disjoint paths with length constraints, Networks 12 (1982), 277-286.
10. W. Mader, Uber die Maximalzahl kreuzungsfreier H-Wedge, Arch Math (Basel) 31 (1978), 387-402.
11. A. Schrijver, A short proof of Mader's S-paths theorem, J Comb Theory Ser. B (to appear).
12. 1/2|E|) general graph matching algorithm, Combinatorica 14 (1994), 71-91.
13. S. Wu and U. Manber, Path-matching problems, Algorithmica 8 (1992), 89-101.
14. H. Yinnone, Maximum number of disjoint paths connecting specified terminals in a graph, Discr Appl Math 55 (1994), 183-195.