Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Thuật toán ghép cặp của Edmonds · Vinony

Home
Graph algorithms
Thuật toán ghép cặp của Edmonds

🌐Tiếng Việt

English Español Français Tiếng Việt Русский فارسی

EntityQ1030529· pop 7· linked from 14 articles

Thuật toán ghép cặp của Edmonds

Also known as Edmonds's matching algorithm

algorithm for constructing maximum matchings on a graph

Available in 7 languages

Español
Français
Русский
Serbian
Tiếng Việt
فارسی

via Wikidata sitelinks · CC0

Connections

International Standard Book Number

Categories

Graph algorithms Matching (graph theory)

Sources

wikipedia.externallinksexternallink

digital object identifier

Entity

linear programming

László Lovász

bipartite graph

Ford–Fulkerson algorithm

glossary of graph theory terms

unimodular matrix

edge contraction

graph traversal

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.41

uniform-cost search

Entitydist 0.42

maximum flow problem

Entitydist 0.48

Entitydist 0.48

Block-matching algorithm

Entitydist 0.49

Dijkstra's algorithm

Entitydist 0.50

Entitydist 0.56

computational problem

Entitydist 0.56

graph rewriting

Entitydist 0.56

Entitydist 0.57

route inspection problem

Entitydist 0.57

Quadratic assignment problem

Entitydist 0.58

What links here14 pages

Edmonds' algorithm

claw-free graph

University of Waterloo

Birkhoff polytope