A structure theorem for the consecutive 1's property
From MaRDI portal
Publication:2543431
DOI10.1016/0095-8956(72)90019-6zbMath0208.52402OpenAlexW2139759040MaRDI QIDQ2543431
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90019-6
Related Items
Algorithmic characterizations of interval orderd hypergraphs and applications, Optimal patchings for consecutive ones matrices, Characterizations of two classes of digraphs, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), Permuting matrices to avoid forbidden submatrices, Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs, 2-nested matrices: towards understanding the structure of circle graphs, On the recognition of permuted bottleneck Monge matrices, Testing for class membership in multi-parent hierarchies, Graphs with largest number of minimum cuts, A bad submatrix is easy to find, Perspectives of Monge properties in optimization, Temporal interval cliques and independent sets, Achieving feasibility for clustered traveling salesman problems using PQ‐trees, Fair allocation of indivisible items with conflict graphs, A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix, Subgraph isomorphism in graph classes, A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row, Bipartite permutation graphs with application to the minimum buffer size problem, Bipartite induced subgraphs and well-quasi-ordering, A new characterization of proper interval graphs, Hardness results on the gapped consecutive-ones property problem, A new characterization of matrices with the consecutive ones property, Hypergraphs and intervals, A conjunctive parallelogram model for Pick any/\(n\) data, Approximation and fixed-parameter algorithms for consecutive ones submatrix problems, Consecutive block minimization is 1.5-approximable, On a certain numbering of the vertices of a hypergraph, Characterization problems for graphs, partially ordered sets, lattices, and families of sets, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Graph classes and the switch Markov chain for matchings, Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results, Red-blue covering problems and the consecutive ones property, The simultaneous consecutive ones problem, Small one-dimensional Euclidean preference profiles, Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction, Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs, On testing consecutive-ones property in parallel, On the consecutive ones property, Biconvex graphs: Ordering and algorithms, Structure theorems for some circular-arc graphs, Characterizations and recognition of circular-arc graphs and subclasses: a survey, A type of algebraic structure related to sets of intervals, Forbidden induced subgraph characterization of circle graphs within split graphs, Structured preferences: a literature survey, Matrix sandwich problems, A heuristic and an exact method for the gate matrix connection cost minimization problem, Circular representation problem on hypergraphs, Obtaining matrices with the consecutive ones property by row deletions, Polynomial-time local-improvement algorithm for consecutive block minimization
Cites Work
