Cyclic ordering is NP-complete
Authors:
- Zvi GalilZGZvi Galil
- Nimrod MegiddoNMNimrod Megiddo
- 1 October 1977
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 5 (2) , 179-182
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 Problems1972