Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430): Difference between revisions
From MaRDI portal
Latest revision as of 20:29, 9 December 2024
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
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