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.
- Phylogenetic graph models beyond trees (Q1026198) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← 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)
- On the thickness of graphs of given degree (Q1174334) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Optimal canonization of all substrings of a string (Q1183603) (← links)
- On finding the minimum bandwidth of interval graphs (Q1183610) (← links)
- A new characterization of proper interval graphs (Q1199478) (← links)
- Processor optimization for flow graphs (Q1200808) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Paths in interval graphs and circular arc graphs (Q1210553) (← links)
- One more polynomial complete consecutive retrieval problem (Q1241287) (← links)
- A recognition algorithm for the intersection graphs of paths in trees (Q1254334) (← links)
- Representing triangulated graphs in stars (Q1261172) (← links)
- A note on the Hamiltonian circuit problem on directed path graphs (Q1262132) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- A polynomially solvable class of quadratic semi-assignment problems (Q1278260) (← links)
- On testing consecutive-ones property in parallel (Q1281757) (← links)
- On probe interval graphs (Q1281778) (← links)
- On the consecutive ones property (Q1281779) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- Computational implementation of Fujishige's graph realizability algorithm (Q1296050) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- On counting planar embeddings (Q1313885) (← links)
