Recommendations
- Cyclic ordering through partial orders
- Cyclic proofs with ordering constraints
- On the Complexity of Some Ordering Problems
- Cyclic orders
- Cyclic base orderings in some classes of graphs
- Non-cyclic sorts for first-order satisfiability
- scientific article; zbMATH DE number 2188410
- On completion of cyclically ordered sets
- On determination of a cyclic order
- On the ordering of 𝑛-modal cycles
Cites work
Cited in
(22)- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Cyclic extensions of order varieties
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- Inclusion relationships among permutation problems
- On the weighted quartet consensus problem
- A new approach for identifying the Kemeny median ranking
- Tractable combinations of temporal CSPs
- A mixed integer linear programming formulation of the maximum betweenness problem
- Vincular pattern avoidance on cyclic permutations
- A new approach to cyclic ordering of 2D orientations using ternary relation algebras
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
- On the complexity of diagram testing
- A priori TSP in the scenario model
- Thinking in Cycles
- Axiomatic scale theory
- Polyhedral structure and properties of a model for layout design
- On Random Ordering Constraints
- Extending partial representations of circular-arc graphs
- Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons
- Simultaneous Embedding
- A priori TSP in the Scenario Model
- Describing hereditary properties by forbidden circular orderings
This page was built for publication: Cyclic ordering is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248373)
