The NP-completeness column: an ongoing guide
- 1 September 1985
- journal article
- research article
- Published by Elsevier in Journal of Algorithms
- Vol. 6 (3) , 434-451
- https://doi.org/10.1016/0196-6774(85)90012-4
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- Domination in permutation graphsJournal of Algorithms, 1985
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- Finding Hamiltonian circuits in proper interval graphsInformation Processing Letters, 1983
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- The subgraph isomorphism problem for outerplanar graphsTheoretical Computer Science, 1982
- A recognition algorithm for the intersection graphs of paths in treesDiscrete Mathematics, 1978
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971