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):
Displayed 50 items.
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- 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)
- 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)
- 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)
- 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)
- 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)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- Finding Hamiltonian circuits in interval graphs (Q1066674) (← links)
- Interval graphs and maps of DNA (Q1071684) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- A linear algorithm for embedding planar graphs using PQ-trees (Q1083864) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
- Finding the minimum bandwidth of an interval graph (Q1090458) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- On-line sorting of twisted sequences in linear time (Q1104753) (← links)
- Testing for class membership in multi-parent hierarchies (Q1107299) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- On the domatic number of interval graphs (Q1111388) (← links)
- A unified approach to domination problems on interval graphs (Q1111566) (← links)
- Total domination in interval graphs revisited (Q1114413) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Recognizing single-peaked preferences on a tree (Q1122456) (← links)
- An efficient PQ-graph algorithm for solving the graph-realization problem (Q1142044) (← links)
- A simple algorithm for finding a cycle of length greater than three and without diagonals (Q1147514) (← links)
- On minimal augmentation of a graph to obtain an interval graph (Q1154281) (← links)
- Optimal packing and covering in the plane are NP-complete (Q1157170) (← links)