A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- 1 December 1981
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 20 (1) , 225-232
- https://doi.org/10.1007/bf01589347
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- On maximal independent sets of vertices in claw-free graphsJournal of Combinatorial Theory, Series B, 1980
- Line perfect graphsMathematical Programming, 1977
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965