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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2017
02419712017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Here we describe the application of two well knowngraph algorithms, Edmonds' algorithm and Prim'salgorithm, to the problem of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We describe a new implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2009
2009
Broadcast is a common communication paradigm in wireless ad hoc networks. This is fulfilled by constructing a spanning tree for… (More)
  • figure 6
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2005
2005
We propose a method for compressing color map images by context tree modeling and arithmetic coding. We consider multicomponent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2003
2003
We consider a general class of optimization problems regarding spanning trees in directed graphs (arborescences). We present an… (More)
  • figure 2.1
  • figure 3.1
Is this relevant?
2003
2003
We study the compression of color map images by context tree modeling and arithmetic coding. The key issue of this method is the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
In the paper, an efficient parallel implementation of Edmonds' algorithm is suggested for finding optimum graph branching on an… (More)
Is this relevant?
1999
1999
We consider the problem of testing the uniqueness of maximum matchings, both in the unweighted and in the weighted case. For the… (More)
Is this relevant?
1998
1998
  • Kasturi R. Varadarajany
  • 1998
Given a set V of 2n points in the plane, we can associate a complete undirected graph G(V) (or simply G) with V as follows. The… (More)
Is this relevant?
Highly Cited
1976
Highly Cited
1976
A matching on a graph is a set of edges, no two of which share a vertex. A maximum matching contains the greatest number of edges… (More)
Is this relevant?