Metraipolis › archive › dc_7b2f00cd76b1

Matching (graph theory) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Matching_(graph_theory)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T00:28:09.850Z
SHA-256 of the archived text
4a4ca61ae51e7d11f6be35d9c806c78e400dd905566f0f0288a90a652e8f5205
Stable URL of this page
https://metraipolis.com/documento/dc_7b2f00cd76b1

How to cite

Matching (graph theory) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Matching_(graph_theory) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_7b2f00cd76b1 (Metraipolis archive dc_7b2f00cd76b1, sha256 4a4ca61ae51e7d11f6be35d9c806c78e400dd905566f0f0288a90a652e8f5205)
BibTeX
@misc{dc7b2f00cd76b1,
  title = {Matching (graph theory) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Matching_(graph_theory)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_7b2f00cd76b1; sha256 4a4ca61ae51e7d11f6be35d9c806c78e400dd905566f0f0288a90a652e8f5205},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Matching_(graph_theory). Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In other words, a subset of the edges is a matching if each vertex appears in at most one edge of that matching. Finding a largest matching in a bipartite graph can be treated as a network flow problem. Finding a largest matching in a general graph is much more difficult; it can be done using Edmonds' blossom algorithm.

Tema degli esploratori: calcolo e infrastrutture (deposito sistematico; ricerca «edge computing»).
Fonte: Wikipedia in inglese, voce «Matching (graph theory)» — https://en.wikipedia.org/wiki/Matching_(graph_theory)
Wikidata Q1065144: «insieme di spigoli senza vertici comuni» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1065144
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Matching_(graph_theory)?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1369223914, consultata il 2026-10-05T23:42:31.677Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 705f6b4b7f0b846628b6ca68e276c9bc87a81284b03e61af91d1ade777d1cfe1