scientific article; zbMATH DE number 3679885

MaRDI QIDQ3875975zbMATH OpenFDO

Authors Kellogg S. Booth, George S. Lueker

Publication date 1975

zbMATH Keywords

0,1-matricesdata structureinterval graphslexicographic breadth first searchlinear algorithmsordered treePQ-tree

Mathematics Subject Classification ID

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

Cited in

(18)

• Recognizing hidden bicircular networks
• Computing an st-numbering
• Cliques that are tolerance digraphs
• The composition of semi-finished inventories at a solid board plant.
• Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
• MPQ-trees for the orthogonal packing problem
• Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy
• Explicit Boij-Söderberg theory of ideals from a graph isomorphism reduction
• Coloring temporal graphs
• All-shortest-path 2-interval routing is NP-complete
• On the complexity of the black-and-white coloring problem on some classes of perfect graphs
• 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
• On the hardness of minimizing space for all-shortest-path interval routing schemes
• MPQ-trees for orthogonal packing problem
• An Optimal Algorithm for Strict Circular Seriation
• Proximity Search for Maximal Subgraph Enumeration
• On-line recognition of interval graphs in O(m+n n) time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875975)