On the longest circuit in an alterable digraph
- 1 October 1995
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 7 (3) , 279-295
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Traveling Salesman Problem with Distances One and TwoMathematics of Operations Research, 1993
- On approximating the longest path in a graph1993
- Probabilistic checking of proofs; a new characterization of NP1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- The polynomial-time hierarchyTheoretical Computer Science, 1976