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 the normal view instead:
scientific article; zbMATH DE number 5772417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem |
scientific article; zbMATH DE number 5772417 |
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
0 references
0.994775414466858
0 references
0.8746869564056396
0 references
0.8446350693702698
0 references
0.8207769989967346
0 references
