The NP-completeness column: An ongoing gulde
- 31 December 1982
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 3 (4) , 381-395
- https://doi.org/10.1016/0196-6774(82)90032-3
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The even‐path problem for graphs and digraphsNetworks, 1984
- Determining the thickness of graphs is NP-hardMathematical Proceedings of the Cambridge Philosophical Society, 1983
- The steiner problem in phylogeny is NP-completeAdvances in Applied Mathematics, 1982
- On structured digraphs and program testingIEEE Transactions on Computers, 1981
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- On Path Cover Problems in Digraphs and Applications to Program TestingIEEE Transactions on Software Engineering, 1979
- On optimum single-row routingIEEE Transactions on Circuits and Systems, 1979
- Via assignment problem in multilayer printed circuit boardIEEE Transactions on Circuits and Systems, 1979
- On Two Problems in the Generation of Program Test PathsIEEE Transactions on Software Engineering, 1976
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972