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

From MaRDI portal
Revision as of 20:33, 19 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers