The NP-completeness column: An ongoing guide
- 31 March 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (1), 147-160
- https://doi.org/10.1016/0196-6774(84)90045-2
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Finding Hamiltonian circuits in proper interval graphsInformation Processing Letters, 1983
- R-domination on block graphsOperations Research Letters, 1982
- Independent domination in chordal graphsOperations Research Letters, 1982
- Packing subgraphs in a graphOperations Research Letters, 1982
- Complexity of finding k-path-free dominating sets in graphsInformation Processing Letters, 1982
- Dominating Sets in Chordal GraphsSIAM Journal on Computing, 1982
- The edge Hamiltonian path problem is NP-completeInformation Processing Letters, 1981
- An algorithm for finding hamiltonian circuits in certain graphsPublished by Springer Nature ,1978
- Rectilinear steiner trees: Efficient special-case algorithmsNetworks, 1977
- On Hamilton's idealsJournal of Combinatorial Theory, Series B, 1972