Skip to main content

Maximum Matchings

  • Chapter
  • 1255 Accesses

Part of the Natural Computing Series book series (NCS)

Abstract

The maximum matching problem is a very well-studied combinatorial optimization problem. Given an undirected graph G=(V,E), a matching is a subset E′⊂E of the edge set such that no two edges in E′ share a common endpoint. The maximum matching problem asks for a matching of maximum cardinality. Such problems arise, e.g., in team planning when edges of a graph denote possible collaborations of workers and the aim is to find a biggest partition of the workers into teams of size 2. Therefore, matching problems have numerous generalizations to hypergraphs and weighted graphs, which will not be discussed in this chapter. The maximum matching problem should not be confused with the maximal matching problem, where the aim is to find a subset of edges which is maximum with respect to inclusion, i.e., no proper superset of the matching is a matching.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-16544-3_6
  • Chapter length: 20 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-16544-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)
Hardcover Book
USD   99.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carsten Witt .

Rights and permissions

Reprints and Permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Neumann, F., Witt, C. (2010). Maximum Matchings. In: Bioinspired Computation in Combinatorial Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16544-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16544-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16543-6

  • Online ISBN: 978-3-642-16544-3

  • eBook Packages: Computer ScienceComputer Science (R0)