Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2010.01.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980860702 / rank | |||
Normal rank | |||
Revision as of 02:41, 20 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
