Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (Q294870)

From MaRDI portal
Revision as of 09:55, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Recognizing \(i\)-triangulated graphs in \(O(mn)\) time
scientific article

    Statements

    Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (English)
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    0 references
    recognition algorithm
    0 references
    breadth-first search
    0 references
    \(i\)-triangulated graph
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references