Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577)
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: Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem |
scientific article |
Statements
Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (English)
0 references
18 August 2010
0 references
out-tree
0 references
out-branching
0 references
internal vertices
0 references
divide-and-conquer
0 references
