Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Blossom_algorithm> ?p ?o. }
Showing items 1 to 17 of
17
with 100 items per page.
- Blossom_algorithm abstract "The blossom algorithm is an algorithm in graph theory for constructing maximum matchings on graphs. The algorithm was discovered by Jack Edmonds in 1961, and published in 1965. Given a general graph G = (V, E), the algorithm finds a matching M such that each vertex in V is incident with at most one edge in M and |M| is maximized. The matching is constructed by iteratively improving an initial empty matching along augmenting paths in the graph. Unlike bipartite matching, the key new idea is that an odd-length cycle in the graph (blossom) is contracted to a single vertex, with the search continuing iteratively in the contracted graph.A major reason that the blossom algorithm is important is that it gave the first proof that a maximum-size matching could be found using a polynomial amount of computation time. Another reason is that it led to a linear programming polyhedral description of the matching polytope, yielding an algorithm for min-weight matching.As elaborated by Alexander Schrijver, further significance of the result comes from the fact that this was the first polytope whose proof of integrality "does not simply follow just from total unimodularity, and its description was a breakthrough in polyhedral combinatorics."".
- Blossom_algorithm thumbnail Edmonds_augmenting_path.svg?width=300.
- Blossom_algorithm wikiPageID "24277294".
- Blossom_algorithm wikiPageRevisionID "606465940".
- Blossom_algorithm hasPhotoCollection Blossom_algorithm.
- Blossom_algorithm subject Category:Graph_algorithms.
- Blossom_algorithm subject Category:Matching.
- Blossom_algorithm comment "The blossom algorithm is an algorithm in graph theory for constructing maximum matchings on graphs. The algorithm was discovered by Jack Edmonds in 1961, and published in 1965. Given a general graph G = (V, E), the algorithm finds a matching M such that each vertex in V is incident with at most one edge in M and |M| is maximized. The matching is constructed by iteratively improving an initial empty matching along augmenting paths in the graph.".
- Blossom_algorithm label "Algoritmo de Emparejamiento de Edmonds".
- Blossom_algorithm label "Blossom algorithm".
- Blossom_algorithm sameAs Algoritmo_de_Emparejamiento_de_Edmonds.
- Blossom_algorithm sameAs m.07sb36l.
- Blossom_algorithm sameAs Q1030529.
- Blossom_algorithm sameAs Q1030529.
- Blossom_algorithm wasDerivedFrom Blossom_algorithm?oldid=606465940.
- Blossom_algorithm depiction Edmonds_augmenting_path.svg.
- Blossom_algorithm isPrimaryTopicOf Blossom_algorithm.
