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.
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- Bipartite permutation graphs with application to the minimum buffer size problem (Q678867) (← links)
- Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
- Interval competition graphs of symmetric digraphs (Q688262) (← links)
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- Recognizing graphs with fixed interval number is NP-complete (Q760213) (← links)
- A nonfactorial algorithm for testing isomorphism of two graphs (Q787177) (← links)
- Circular representation problem on hypergraphs (Q799695) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Common intervals of trees (Q834996) (← links)
- An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465) (← links)
- Domination in convex and chordal bipartite graphs (Q918703) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
- A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class (Q924681) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Approximation algorithm for coloring of dotted interval graphs (Q963476) (← links)
- On probe permutation graphs (Q967305) (← links)
- Branchwidth of chordal graphs (Q967314) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← 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)
- Labelling algorithms for paired-domination problems in block and interval graphs (Q987497) (← links)
- A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- Recognizing edge clique graphs among interval graphs and probe interval graphs (Q998556) (← links)
- Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
- The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Algorithms for maximum independent set in convex bipartite graphs (Q1017904) (← links)
- Testing planarity of geometric automorphisms in linear time (Q1018045) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- The simultaneous consecutive ones problem (Q1019172) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
