Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430)

From MaRDI portal
Revision as of 20:29, 9 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
Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
scientific article

    Statements

    Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (English)
    0 references
    0 references
    0 references
    11 May 2017
    0 references
    parameterized algorithm
    0 references
    \(k\)-internal out-branching
    0 references
    \(k\)-tree
    0 references
    multilinear detection
    0 references
    proper coloring
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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