Skip to main content

Part of the book series: Algorithms and Combinatorics ((AC,volume 3))

  • 397 Accesses

Abstract

This chapter recapitulates the mathematical preliminaries needed in the subsequent arguments. In particular, brief mention is made of the relevant concepts in algebra, graph theory and matroid theory. Emphasis is laid on the algebraic independence, the Dulmage-Mendelsohn decomposition of bipartite graphs with reference to matchings, and the decomposition principle of submodular functions. Some observations which are not explicit in the literature are also made.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

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

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Murota, K. (1987). Preliminaries. In: Systems Analysis by Graphs and Matroids. Algorithms and Combinatorics, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61586-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-61586-3_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17659-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics