Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs (Q5317569)

From MaRDI portal
Revision as of 11:27, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2206248
Language Label Description Also known as
English
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
scientific article; zbMATH DE number 2206248

    Statements

    Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs (English)
    0 references
    0 references
    0 references
    16 September 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    bipartite permutation graphs
    0 references
    bipartite trapezoid graphs
    0 references
    proper circular arc graphs
    0 references
    lexicographic breadth first search
    0 references
    certifying algorithms
    0 references
    forbidden subgraph characterizations
    0 references
    0 references