A note on disjoint arborescences (Q532132): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974428378 / rank | |||
Normal rank | |||
Revision as of 01:54, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on disjoint arborescences |
scientific article |
Statements
A note on disjoint arborescences (English)
0 references
26 April 2011
0 references
The author extends a theorem on packing arc-disjoint arborescences by \textit{N. Kamiyama, N. Katoh} and \textit{A. Takizawa} [Combinatorica 29, No.~2, 197--214 (2009; Zbl 1212.05209)]. As a consequence, the problem of finding minimum-weight arc-disjoint arborescences that span given convex sets with roots can be solved in polynomial time.
0 references
arborescences
0 references
branching
0 references
reachability
0 references
spanning trees
0 references
