Abstract
The notion of matching in graphs is generalized in this paper to a set of paths rather than to a set of edges. The generalized problem, which we call thepath-matching problem, is to pair the vertices of an undirected weighted graph such that the paths connecting each pair are subject to certain objectives and/or constraints. This paper concentrates on the case where the paths are required to be edge-disjoint and the objective is to minimize the maximal cost of a path in the matching (i.e., the bottleneck version). Other variations of the problem are also mentioned. Two algorithms are presented to find the best matching under the constraints listed above for trees. Their worst-case running times areO(n logd logw), whered is the maximal degree of a vertex,w is the maximal cost of an edge, andn is the size of the tree, andO(n 2), respectively. The problem is shown to be NP-complete for general graphs. Applications of these problems are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gabow, H. N. and R. E. Tarjan, Algorithms for two bottleneck optimization problems,J. Algorithms,9, (1988), 411–417.
Karp, R. M., On the complexity of combinatorial problems,Networks,5 (1975), 45–68.
Lawler, E. L.,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976.
Papadimitriou, C. H. and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
Wu S. and U. Manber, Algorithms for generalized matching, Technical Report, TR 88-39, Department of Computer Science, University of Arizona (November 1988).
Author information
Authors and Affiliations
Additional information
Communicated by Nimrod Megiddo.
Udi Manber was supported in part by an NSF Presidential Young Investigator Award (Grant DCR-8451397), with matching funds from AT&T.