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.
- 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)
- A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Finding the closed partition of a planar graph (Q1322561) (← links)
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Recognition of \(d\)-dimensional Monge arrays (Q1329798) (← links)
- Algorithms for interval catch digraphs (Q1329814) (← links)
- Arboricity and bipartite subgraph listing algorithms (Q1334644) (← links)
- Characterizations of two classes of digraphs (Q1336693) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072) (← links)
- Proper interval graphs and the guard problem (Q1363667) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- On minimum intersection of two minimum dominating sets of interval graphs (Q1377653) (← links)
- Recognition of Robinsonian dissimilarities (Q1378872) (← links)
- Unit disk graph recognition is NP-hard (Q1384186) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- A selected tour of the theory of identification matrices (Q1575436) (← links)
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664) (← links)
- A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
- Reconstruction graphs and testing their properties in a relational spatial database (Q1609074) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)