Abstract
The vertex packing problem for a given graph is to find a maximum number of vertices no two of which are joined by an edge. The weighted version of this problem is to find a vertex packingP such that the sum of the individual vertex weights is maximum. LetG be the family of graphs whose longest odd cycle is of length not greater than 2K + 1, whereK is any non-negative integer independent of the number (denoted byn) of vertices in the graph. We present an O(n 2K+1) algorithm for the maximum weighted vertex packing problem for graphs inG ≥ 1. A by-product of this algorithm is an algorithm for piecing together maximum weighted packings on blocks to find maximum weighted packings on graphs that contain more than one block. We also give an O(n 2K+3) algorithm for testing membership inG
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman,The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974).
J. Edmonds, “Paths, trees and flowers”,Canadian Journal of Mathematics 17 (1962) 449–467.
L.R. Ford and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, NJ, 1962).
D.R. Fulkerson, “Anti-blocking polyhedra”,Journal of Combinatorial Theory 12 (1972) 50–71.
M.R. Garey, D.S. Johnson and L. Stockmeyer, “Some simplified NP-complete graph problems”,Theoretical Computer Science 1 (1976) 237–267.
F. Gavril, “Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph”,SIAM Journal on Computing 1 (1972) 180–187.
F. Harary,Graph theory (Addison-Wesley, Reading, MA, 1969).
J.E. Hopcroft and R.M. Karp, “Ann 5/2algorithm for maximum matchings in bipartite graphs”,SIAM Journal on Computing 2 (1973) 225–231.
W.-L. Hsu, “Efficient algorithms for some packing and covering problems on graphs”, Ph.D. Thesis, Cornell University (1980).
A.V. Karzanov, “Determining the maximal flow in a network by the method of preflow”,Soviet Mathematics Doklady 15 (1974) 434–437.
G.J. Minty, “On maximal independent sets of vertices in claw-free graphs”,Journal of Combinatorial Theory (B) 28 (1980) 284–304.
G.L. Nemhauser and L.E. Trotter Jr., “Properties of vertex packing and independence system polyhedra”,Mathematical Programming 6 (1974) 48–61.
L.E. Trotter Jr., “Line perfect graphs”,Mathematical Programming 12 (1977) 255–259.
Author information
Authors and Affiliations
Additional information
This work was supported by NSF grant ENG75-00568 to Cornell University. Some of the results of this paper have appeared in Hsu's unpublished Ph.D. dissertation [9].
Rights and permissions
About this article
Cite this article
Hsu, Wl., Ikura, Y. & Nemhauser, G.L. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles. Mathematical Programming 20, 225–232 (1981). https://doi.org/10.1007/BF01589347
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01589347