книги Наука, техника, медицина Естественные науки Точные науки Математика

Blossom algorithm

Код 3292676

  • ISBN: 978-5-5145-5275-7

Нет в продаже

Аннотация к книге "Blossom algorithm"

High Quality Content by WIKIPEDIA articles! 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.

Оставить комментарий

Оцените книгу:

ISBN: 978-5-5145-5275-7

Книга находится в категориях

Машиностроение

Вместе с этой книгой покупают