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 21 items.
- Bipartite permutation graphs with application to the minimum buffer size problem (Q678867) (← links)
- Circular representation problem on hypergraphs (Q799695) (← 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)
- 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)
- 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)
- (Q3669457) (← links)
- (Q3927282) (← links)
- A bad submatrix is easy to find (Q4305120) (← links)