Skip to main content

Matchings

  • 8660 Accesses

Part of the Leitfäden der Informatik book series

Zusammenfassung

Wir haben Matchings bereits in Abschnitt 9.10 (Heiratssatz, Satz von Kőnig) kennengelernt.

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-8348-2264-2_10
  • Chapter length: 28 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   44.99
Price excludes VAT (USA)
  • ISBN: 978-3-8348-2264-2
  • 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   59.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

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden

About this chapter

Cite this chapter

Krumke, S., Noltemeier, H. (2012). Matchings. In: Graphentheoretische Konzepte und Algorithmen. Leitfäden der Informatik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-8348-2264-2_10

Download citation