Skip to search formSkip to main contentSkip to account menu

Edmonds' algorithm

Known as: Chu-Liu/Edmonds algorithm, Edmonds algorithm, Edmond's algorithm 
In graph theory, Edmonds' algorithm or Chu–Liu/Edmonds' algorithm is an algorithm for finding a spanning arborescence of minimum weight (sometimes… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
AlgorithmC++Directed graphGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Optimization of Distributed SPARQL Queries Using Edmonds' Algorithm and Prim's Algorithm
Here we describe the application of two well knowngraph algorithms, Edmonds' algorithm and Prim'salgorithm, to the problem of… 
2008
2008
On the vertices of the k-additive core
2006
2006
Innocents Convicted: An Empirically Justified Wrongful Conviction Rate
That would make the error rate [in felony convictions] .027 percent - or to put it another way, a success rate of 99.973 percent… 
Review
2000
Review
2000
Linear Programming Based Methods for Solving Arc Routing Problems
From the pioneering works of Dantzig, Edmonds and others, polyhedral (i.e. linear programming based) methods have been… 
1995
1995
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs
We prove an unexpected upper bound on a communication game proposed by Jeff Edmonds and Russell Impagliazzo [2, 3] as an approach… 
Review
1989
Review
1989
Biology, Ecology, and Epidemiology of Heterobasidion annosum
Pertinent literature on the biological aspects of annosus root disease is reviewed. Key features of the life cycle of… 
1987
1987
Vertex-disjoint paths and edge-disjoint branchings in directed graphs
A theorem of J. Edmonds states that a directed graph has k edge-disjoint branchings rooted at a vertex r if and only if every… 
1982
1982
Minimization on submodular flows
1977
1977
How tachyons do not violate causality: An answer to Edmonds
The paper by EDMONDS (1) we comment here is well writ ten: it is mostly based inc iden ta l ly -on the so-called by MIGNANI and… 
Highly Cited
1971
Highly Cited
1971
A simple derivation of Edmonds' algorithm for optimum branchings
Edmonds [1] has given an algorithm for constructing a maximum-weight branching in a weighted directed graph. His proof that the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)