A Simple Test for the Consecutive Ones Property
From MaRDI portal
Publication:3150269
DOI10.1006/jagm.2001.1205zbMath1050.68164OpenAlexW2071735110MaRDI QIDQ3150269
No author found.
Publication date: 30 September 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2001.1205
Related Items
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace ⋮ PC trees and circular-ones arrangements. ⋮ On Robinsonian dissimilarities, the consecutive ones property and latent variable models ⋮ A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row ⋮ Tractability Results for the Consecutive-Ones Property with Multiplicity ⋮ Circular-arc hypergraphs: rigidity via connectedness ⋮ A REVIEW OF TREE CONVEX SETS TEST ⋮ A faster algorithm for finding minimum Tucker submatrices ⋮ Hardness results on the gapped consecutive-ones property problem ⋮ A new characterization of matrices with the consecutive ones property ⋮ Approximation and fixed-parameter algorithms for consecutive ones submatrix problems ⋮ Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results ⋮ Consecutive Ones Property Testing: Cut or Swap ⋮ Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction ⋮ Characterizations and recognition of circular-arc graphs and subclasses: a survey ⋮ Obtaining matrices with the consecutive ones property by row deletions ⋮ Polynomial-time local-improvement algorithm for consecutive block minimization ⋮ Minimising the number of gap-zeros in binary matrices
This page was built for publication: A Simple Test for the Consecutive Ones Property
