Matching and Vertex Packing: How “hard” are They?
- 1 January 1993
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 118 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Two-dimensional monomer-dimer systems are computationally intractableJournal of Statistical Physics, 1990
- On generating all maximal independent setsInformation Processing Letters, 1988
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Planar 3DM is NP-completeJournal of Algorithms, 1986
- BPP and the polynomial hierarchyInformation Processing Letters, 1983
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- Dimer Statistics and Phase TransitionsJournal of Mathematical Physics, 1963