Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60488594, #quickstatements; #temporary_batch_1706974296281 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:49, 5 March 2024
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
