Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538)

From MaRDI portal
Revision as of 03:08, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time
scientific article

    Statements

    Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (English)
    0 references
    0 references
    0 references
    12 March 2012
    0 references
    breadth-first search (BFS)
    0 references
    trapezoid graphs
    0 references
    permutation graphs
    0 references
    interval graphs
    0 references
    shortest paths
    0 references
    graph algorithms
    0 references
    BFS tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references