Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on finding optimum branchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5567717 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum branchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for two bottleneck optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple derivation of edmonds' algorithm for optimum branchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding optimum branchings / rank | |||
Normal rank | |||
Latest revision as of 17:56, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Arborescence optimization problems solvable by Edmonds' algorithm |
scientific article |
Statements
Arborescence optimization problems solvable by Edmonds' algorithm (English)
0 references
30 July 2003
0 references
minimum arborescence
0 references
minimum directed spanning tree
0 references
Bottleneck
0 references
arborescence
0 references
lexicographically optimal arborescence
0 references
widest-minimum spanning tree
0 references
0 references
