In graph theory, Edmonds' algorithm or Chu–Liu/Edmonds' algorithm is an algorithm for finding a spanning arborescence of minimum weight (sometimes… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Benjamin P. Vandervalk, E. Luke McCarthy, Mark D. Wilkinson
- 2009 International Conference on Computational…
- 2009

Here we describe the application of two well knowngraph algorithms, Edmonds' algorithm and Prim'salgorithm, to the problem of… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Vladimir Kolmogorov
- Math. Program. Comput.
- 2009

We describe a new implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer… (More)

Is this relevant?

2009

2009

- Li-Sheng Chen, Hwang-Cheng Wang
- 2009 5th International Conference on Wireless…
- 2009

Broadcast is a common communication paradigm in wireless ad hoc networks. This is fulfilled by constructing a spanning tree for… (More)

Is this relevant?

2005

2005

- Pavel Kopylov, Pasi Fränti
- IEEE Transactions on Image Processing
- 2005

We propose a method for compressing color map images by context tree modeling and arithmetic coding. We consider multicomponent… (More)

Is this relevant?

2003

2003

- Leonidas Georgiadis
- Theor. Comput. Sci.
- 2003

We consider a general class of optimization problems regarding spanning trees in directed graphs (arborescences). We present an… (More)

Is this relevant?

2003

2003

- Pavel Kopylov, Pasi Fränti
- DCC
- 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)

Is this relevant?

2001

2001

- Anna Nepomniaschaya
- Programming and Computer Software
- 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

- Harold N. Gabow, Haim Kaplan, Robert E. Tarjan
- STOC
- 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

- Harold N. Gabow
- J. ACM
- 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?