Pages that link to "Item:Q2543431"
From MaRDI portal
The following pages link to A structure theorem for the consecutive 1's property (Q2543431):
Displayed 42 items.
- A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix (Q456131) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Bipartite permutation graphs with application to the minimum buffer size problem (Q678867) (← links)
- Circular representation problem on hypergraphs (Q799695) (← links)
- A new characterization of matrices with the consecutive ones property (Q967442) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Consecutive block minimization is 1.5-approximable (Q975428) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- The simultaneous consecutive ones problem (Q1019172) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Testing for class membership in multi-parent hierarchies (Q1107299) (← links)
- A new characterization of proper interval graphs (Q1199478) (← links)
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- On testing consecutive-ones property in parallel (Q1281757) (← links)
- On the consecutive ones property (Q1281779) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- Algorithmic characterizations of interval orderd hypergraphs and applications (Q1329816) (← links)
- Characterizations of two classes of digraphs (Q1336693) (← links)
- Biconvex graphs: Ordering and algorithms (Q1570816) (← links)
- Hardness results on the gapped consecutive-ones property problem (Q1759853) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
- Graphs with largest number of minimum cuts (Q1917282) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Small one-dimensional Euclidean preference profiles (Q2058844) (← links)
- A conjunctive parallelogram model for Pick any/\(n\) data (Q2259997) (← links)
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
- Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
- Polynomial-time local-improvement algorithm for consecutive block minimization (Q2345864) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- Structure theorems for some circular-arc graphs (Q2563173) (← links)
- A heuristic and an exact method for the gate matrix connection cost minimization problem (Q2862155) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- Bipartite induced subgraphs and well-quasi-ordering (Q3018076) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (Q3638844) (← links)
- (Q3669457) (← links)
- (Q3927282) (← links)
- A bad submatrix is easy to find (Q4305120) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)