A certifying algorithm for the consecutive-ones property
From MaRDI portal
Recommendations
Cited in
(22)- Phylogenetic graph models beyond trees
- PC trees and circular-ones arrangements.
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results
- Obtaining matrices with the consecutive ones property by row deletions
- Iterated local search for consecutive block minimization
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
- A polynomial-time algorithm for finding a minimal conflicting set containing a given row
- Consecutive ones property testing: cut or swap
- A Simple Test for the Consecutive Ones Property
- Parallel recognition of the consecutive ones property with applications
- scientific article; zbMATH DE number 5606342 (Why is no real title available?)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs
- Proper Helly Circular-Arc Graphs
- A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
- Certifying algorithms
- On counting interval lengths of interval graphs
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency
- Certifying induced subgraphs in large graphs
- A faster algorithm for finding minimum Tucker submatrices
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
- A note on computing set overlap classes
This page was built for publication: A certifying algorithm for the consecutive-ones property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501338)
