scientific article

zbMath0436.05058MaRDI QIDQ3875975

Kellogg S. Booth, George S. Lueker

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

interval graphslinear algorithmsdata structureordered treelexicographic breadth first search0,1-matricesPQ-tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99) Algorithms in computer science (68W99)

Related Items

MPQ-trees for orthogonal packing problem ⋮ Proximity Search for Maximal Subgraph Enumeration ⋮ All-shortest-path 2-interval routing is NP-complete ⋮ Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy ⋮ Cliques that are tolerance digraphs ⋮ Explicit Boij-Söderberg theory of ideals from a graph isomorphism reduction ⋮ MPQ-trees for the orthogonal packing problem ⋮ On the complexity of the black-and-white coloring problem on some classes of perfect graphs ⋮ The composition of semi-finished inventories at a solid board plant. ⋮ A convexity upper bound for the number of maximal bicliques of a bipartite graph ⋮ Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices ⋮ Coloring temporal graphs ⋮ On the hardness of minimizing space for all-shortest-path interval routing schemes ⋮ Recognizing hidden bicircular networks ⋮ Computing an st-numbering ⋮ Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs ⋮ An Optimal Algorithm for Strict Circular Seriation