Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs |
scientific article; zbMATH DE number 6714294
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs |
scientific article; zbMATH DE number 6714294 |
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
