The NP-completeness column: An ongoing guide
- 31 December 1981
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 2 (4), 393-405
- https://doi.org/10.1016/0196-6774(81)90037-7
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- On the complexity of integer programmingJournal of the ACM, 1981
- Primality testing algorithms [after Adleman, Rumely and Williams]Published by Springer Nature ,1981
- On deciding switching equivalence of graphsDiscrete Applied Mathematics, 1980
- A Polynomial Solution to the Undirected Two Paths ProblemJournal of the ACM, 1980
- An algorithm for imbedding cubic graphs in the torusJournal of Computer and System Sciences, 1980
- The subgraph homeomorphism problemJournal of Computer and System Sciences, 1980
- A note on Delaunay and optimal triangulationsInformation Processing Letters, 1980
- Khachiyan's linear programming algorithmJournal of Algorithms, 1980
- A Polynomial Algorithm for the Two-Variable Integer Programming ProblemJournal of the ACM, 1980
- Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulationInformation Processing Letters, 1979