Matching
A matching of a graph is a subset of edges that do not share any endpoints. Matching can be used in many applications including channel frequency assignment in radio networks, graph partitioning, and clustering. In an unweighted graph, maximum matching of a graph is the set of edges that has the max...
Saved in:
| Published in | Guide to Graph Algorithms pp. 263 - 303 |
|---|---|
| Main Author | |
| Format | Book Chapter |
| Language | English |
| Published |
Switzerland
Springer International Publishing AG
2018
Springer International Publishing |
| Series | Texts in Computer Science |
| Online Access | Get full text |
| ISBN | 331973234X 9783319732343 |
| ISSN | 1868-0941 1868-095X |
| DOI | 10.1007/978-3-319-73235-0_9 |
Cover
| Summary: | A matching of a graph is a subset of edges that do not share any endpoints. Matching can be used in many applications including channel frequency assignment in radio networks, graph partitioning, and clustering. In an unweighted graph, maximum matching of a graph is the set of edges that has the maximum cardinality among all matchings in that graph. In an edge-weighted weighted graph, our aim is to find a matching with the maximum (or minimum) total weight. Finding a maximum (weighted) matching in an unweighted or weighted graph is one of the rare graph problems that can be solved in polynomial time. We review sequential, parallel, and distributed algorithms for unweighted and weighted general graphs and bipartite graphs in this chapter. |
|---|---|
| ISBN: | 331973234X 9783319732343 |
| ISSN: | 1868-0941 1868-095X |
| DOI: | 10.1007/978-3-319-73235-0_9 |