Ranking arborescences in O(Km log n) time (Q1142709)
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: Ranking arborescences in O(Km log n) time |
scientific article; zbMATH DE number 3687123
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ranking arborescences in O(Km log n) time |
scientific article; zbMATH DE number 3687123 |
Statements
Ranking arborescences in O(Km log n) time (English)
0 references
1980
0 references
edge weighted directed graph
0 references
weighted spanning arborescences
0 references
computational complexity
0 references
polynomial algorithm
0 references
0 references
