Pages that link to "Item:Q1242450"
From MaRDI portal
The following pages link to Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450):
Displaying 50 items.
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Consecutive retrieval property -- revisited (Q294594) (← links)
- Edge intersection graphs of \(L\)-shaped paths in grids (Q299080) (← links)
- Chronological rectangle digraphs (Q324764) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Edge search number of cographs (Q415273) (← links)
- Reasoning about visibility (Q420853) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- Backup 2-center on interval graphs (Q442280) (← links)
- A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix (Q456131) (← links)
- Certifying algorithms (Q465678) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- Interval graph representation with given interval and intersection lengths (Q491160) (← links)
- Finding outer-connected dominating sets in interval graphs (Q495667) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- On counting interval lengths of interval graphs (Q531590) (← links)
- Common intervals of multiple permutations (Q534763) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- A characterization of the single-peaked domain (Q622583) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- Subgraphs of 4-regular planar graphs (Q644803) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution (Q664176) (← links)
- Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
- \texttt{PQser:} a Matlab package for spectral seriation (Q670489) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
