The NP-completeness column: An ongoing guide
- 30 June 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (2), 285-303
- https://doi.org/10.1016/0196-6774(87)90043-5
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Nonconstructive advances in polynomial-time complexityInformation Processing Letters, 1987
- O(n2.5) time algorithms for the subgraph homeomorphism problem on treesJournal of Algorithms, 1987
- Exact and Approximate Solutions for the Gate Matrix Layout ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- The metamathematics of the graph minor theoremContemporary Mathematics, 1987
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithmMathematical Programming, 1986
- An approach to the subgraph homeomorphism problemTheoretical Computer Science, 1985
- Knots and links in spatial graphsJournal of Graph Theory, 1983
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967