A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118)

From MaRDI portal
Revision as of 00:55, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
scientific article

    Statements

    A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (English)
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    0 references
    depth-first search
    0 references
    spanning tree
    0 references
    trapezoid graphs
    0 references
    permutation graphs
    0 references