Abstract
The problem of finding a minimum cardinality set of nodes in a graph which meet every edge is of considerable theoretical as well as practical interest. Because of the difficulty of this problem, a linear relaxation of an integer programming model is sometimes used as a heuristic. In fact Nemhauser and Trotter showed that any variables which receive integer values in an optimal solution to the relaxation can retain the same values in an optimal solution to the integer program. We define 2-bicritical graphs and give several characterizations of them. One characterization is that they are precisely the graphs for which an optimal solution to the linear relaxation will have no integer valued variables. Then we show that almost all graphs are 2-bicritical and hence the linear relaxation almost never helps for large random graphs.
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).
M.L. Balinski, “Integer programming: Methods, uses, computation”,Management Science 12 (1965) 253–313.
C. Berge, “Regularizable graphs”, in:Proceedings of the Calcutta conference on graph theory, Indian Statistical Institute, December 1976.
V. Chvátal, “Determining the stability number of a graph”,SIAM Journal of Computing 6 (1977) 643–662.
G. Cornuéjols, “Degree sequences of random graphs”, Discussion Paper 7818, Center for Operations Research and Econometrics, University of Louvain (1978).
J. Edmonds, “Maximum matching and a polyhedron with 0–1 vertices”,Journal of Research of the National Bureau of Standards 69B (1965) 125–130.
P. Erdös, “Some remarks on the theory of graphs”,Bulletin of the American Mathematical Society 53 (1947) 292–294.
P. Erdös and J. Spencer,Probabilistic methods in combinatorics (Academic Press, New York, 1974).
G.R. Grimmett and C.J.H. McDiarmid, “On colouring random graphs”,Mathematical Proceedings of the Cambridge Philosophical Society 77 (1975) 313–324.
R.M. Karp, “Reducibility among combinatorial problems”, in: R.E. Miller and J.W. Thatcher, eds.,Complexity of computer computations (Plenum Press, New York, 1972, pp. 85–104.
C.J.H. McDiarmid, “Determining the chromatic number of a graph”,SIAM Journal of Computing, to appear.
G.L. Nemhauser and L.E. Trotter, “Vertex packings: Structural properties and algorithms”,Mathematical Programming 8 (1975) 232–248.
J.C. Picard and M. Quéyranne, “On the integer valued variables in the linear vertex packing problem”,Mathematical Programming 12 (1977) 97–101.
J.C. Picard and M. Quéyranne, “Vertex packings (VLP)—reductions through alternate labelling”, Tech. Rept. EP75-R-47, Ecole Polytechnique, University of Montreal (1975).
W.R. Pulleyblank, “Dual integrality inb-matching problems”, Discussion Paper 7717, Center for Operations Research and Econometrics, University of Louvain (1977).
W.T. Tutte, “The factors of graphs”,Canadian Journal of Mathematics 4 (1952) 314–328.
Author information
Authors and Affiliations
Additional information
This research was supported in part by the National Research Council of Canada.
Rights and permissions
About this article
Cite this article
Pulleyblank, W.R. Minimum node covers and 2-bicritical graphs. Mathematical Programming 17, 91–103 (1979). https://doi.org/10.1007/BF01588228
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588228