Cyclic Ordering is NP-Complete

@article{Galil1977CyclicOI,
  title={Cyclic Ordering is NP-Complete},
  author={Zvi Galil and Nimrod Megiddo},
  journal={Theor. Comput. Sci.},
  year={1977},
  volume={5},
  pages={179-182}
}
The cyclic ordering problem is to recognize whether a collection of cyclically ordered triples of elements of a set T is derived from an arrangement of all the elements of T on a circle. This problem is shown to be NP-complete. A cyclic ordering of a set T = {l,. ., t ) is essentially an arrangement of the elements of T on a circle. A specific definition is as follows (see [4]). Two linear orders, (a, , . . . , a , ) and (b,, . . ., b,), on T are called cyclically equivalent if there exists a… CONTINUE READING
31 Citations
2 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Partial and complete cyclic orders

  • N. Meggido
  • Bull. Am. Math. Soc
  • 1976

The Art of Computer Programming Vol. 1 (Addison-Wesley

  • D. E. Knuth
  • 1968

Similar Papers

Loading similar papers…