Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603)

From MaRDI portal
Revision as of 02:43, 5 November 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129409158, #quickstatements; #temporary_batch_1730771004477)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
scientific article

    Statements

    Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 April 2020
    0 references
    graph enumeration
    0 references
    graph algorithms
    0 references
    polynomial delay
    0 references
    degeneracy
    0 references
    chordal graphs
    0 references
    clique trees
    0 references

    Identifiers

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