Edmonds' algorithm
In graph theory, Edmonds' algorithm or Chu–Liu/Edmonds' algorithm is an algorithm for finding a spanning arborescence of minimum weight (sometimes called an optimum branching).It is the directed analog of the minimum spanning tree problem.The algorithm was proposed independently first by Yoeng-Jin Chu and Tseng-Hong Liu (1965) and then by Jack Edmonds (1967).
- Comment
- enIn graph theory, Edmonds' algorithm or Chu–Liu/Edmonds' algorithm is an algorithm for finding a spanning arborescence of minimum weight (sometimes called an optimum branching).It is the directed analog of the minimum spanning tree problem.The algorithm was proposed independently first by Yoeng-Jin Chu and Tseng-Hong Liu (1965) and then by Jack Edmonds (1967).
- Has abstract
- enIn graph theory, Edmonds' algorithm or Chu–Liu/Edmonds' algorithm is an algorithm for finding a spanning arborescence of minimum weight (sometimes called an optimum branching).It is the directed analog of the minimum spanning tree problem.The algorithm was proposed independently first by Yoeng-Jin Chu and Tseng-Hong Liu (1965) and then by Jack Edmonds (1967).
- Hypernym
- Algorithm
- Is primary topic of
- Edmonds' algorithm
- Label
- enEdmonds' algorithm
- Link from a Wikipage to an external page
- faculty.washington.edu/jungyeul/chu-liu_1965.pdf
- github.com/atofigh/edmonds-alg/
- networkx.github.io/documentation/networkx-1.10/reference/generated/networkx.algorithms.tree.branchings.Edmonds.html
- Link from a Wikipage to another Wikipage
- Algorithm
- Arborescence (graph theory)
- BSD
- C++
- Category:Graph algorithms
- Directed graph
- Graph theory
- Harold N. Gabow
- Jack Edmonds
- Minimum spanning tree
- MIT License
- Prim's algorithm
- Python (programming language)
- Robert Tarjan
- Spanning subgraph
- Sparse graph
- Zvi Galil
- SameAs
- Algoritmo de Edmond
- Algoritmo di Edmonds
- Edmonds
- Edmonds' algorithm
- Edmonds-algoritmus
- iCW9
- m.02rgbmp
- Q1752324
- Алгоритм Эдмондса
- Алгоритм двох китайців
- Едмондсов алгоритам
- الگوریتم ادمون
- ขั้นตอนวิธีของเอ็ดมอนส์
- Subject
- Category:Graph algorithms
- WasDerivedFrom
- Edmonds' algorithm?oldid=1097006524&ns=0
- WikiPageLength
- 7119
- Wikipage page ID
- 11510650
- Wikipage revision ID
- 1097006524
- WikiPageUsesTemplate
- Template:About
- Template:Citation
- Template:Graph search algorithm
- Template:Short description