On the consecutive ones property
From MaRDI portal
Recommendations
Cites work
- A structure theorem for the consecutive 1's property
- Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach
- Algorithmic Aspects of Vertex Elimination on Graphs
- Construction of ternary H_v-groups and ternary P-hyperoperations.
- File organization
- Incidence matrices and interval graphs
- Incidence matrices, interval graphs and seriation in archeology
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(42)- Red-blue covering problems and the consecutive ones property
- On testing consecutive-ones property in parallel
- PC trees and circular-ones arrangements.
- Finding maximum edge bicliques in convex bipartite graphs
- Hardness results on the gapped consecutive-ones property problem
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- An extension of a theorem of Fulkerson and Gross
- A note on the consecutive ones submatrix problem.
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results
- Obtaining matrices with the consecutive ones property by row deletions
- Set covering with almost consecutive ones property
- On Robinsonian dissimilarities, the consecutive ones property and latent variable models
- On the gapped consecutive-ones property
- A polynomial-time algorithm for finding a minimal conflicting set containing a given row
- Tractability results for the consecutive-ones property with multiplicity
- Filters for Efficient Composition of Weighted Finite-State Transducers
- A Simple Test for the Consecutive Ones Property
- A filter-based algorithm for efficient composition of finite-state transducers
- Parallel recognition of the consecutive ones property with applications
- scientific article; zbMATH DE number 5606342 (Why is no real title available?)
- Convex relaxations for permutation problems
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs
- Consecutive Units
- A faster algorithm for finding minimum Tucker submatrices
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
- scientific article; zbMATH DE number 15401 (Why is no real title available?)
- A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
- A review of tree convex sets test
- Modeling recreational systems using optimization techniques and information technologies
- Counting the orderings for multisets in consecutive ones property and PQ-trees
- A note on consecutive ones in a binary matrix
- Treemaps for Directed Acyclic Graphs
- A certifying algorithm for the consecutive-ones property
- Algorithms and Computation
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
- A faster algorithm for finding minimum Tucker submatrices
- Finding maximum edge bicliques in tree convex graphs
- Successful pressing sequences for a bicolored graph and binary matrices
- Intersection representations of matrices by subtrees and unicycles on graphs
- A new characterization of matrices with the consecutive ones property
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
- Consecutive block minimization is 1.5-approximable
This page was built for publication: On the consecutive ones property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281779)
