Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488)

From MaRDI portal
Revision as of 08:17, 11 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
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
scientific article

    Statements

    Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (English)
    0 references
    24 May 2018
    0 references
    recognition algorithms
    0 references
    linear-time complexity
    0 references
    SPQR-trees
    0 references
    chordless graphs
    0 references
    propeller-free graphs
    0 references

    Identifiers