Cyclic ordering is NP-complete
- 31 October 1977
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 5 (2) , 179-182
- https://doi.org/10.1016/0304-3975(77)90005-6
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Partial and complete cyclic ordersBulletin of the American Mathematical Society, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972