Path, Trees and Flowers

Jan 20, 2016 · Madrid, Spain

We will talk about the paper "Path, Trees and Flowers" by Jack Edmonds.

This paper is seminal in graph theory. It describes the maximum matchings blossom algorithm, which finds a decomposition of a graph in the maximum number of pairs connected by an edge.

It is also the base of the famous minimum weight maximum matchings algorithm, a very important algorithm used in many applications, from pairing in chess tournaments to resources or worker placement within companies.

Event organizers
  • Papers We Love Madrid

    Madrid chapter of Papers We Love What was the last paper within the realm of computing you read? What did it inspire you to build or tinker with? Come share the ideas in an awesome academic/research publication with fellow engineers, programmers, and paper-readers. Lead a session and show off code that you wrote that implements these ideas or just give us the lowdown about the paper. Otherwise, just come, listen, learn, and discuss. We'll be using papers-we-love's curated repository . Please contribute by

    Recent Events

Are you organizing Path, Trees and Flowers?

Claim the event and start manage its content.

I am the organizer

based on 0 reviews