Logo - springer
Slogan - springer

New & Forthcoming Titles | Topics in Matroid Theory

Topics in Matroid Theory

Pitsoulis, Leonidas S.

2014, XIV, 127 p. 46 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$39.99

(net) price for USA

ISBN 978-1-4614-8957-3

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$54.99

(net) price for USA

ISBN 978-1-4614-8956-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • ​​​​​Provides a sollid introduction to matroid theory
  • Present results in matroid theory as they appear in the context of combinatorial optimization​
  • Contains a strong emphasis on algorithmic consequences of matroid theory

Topics in Matroid Theory provides a brief introduction to matroid theory with an emphasis on algorithmic consequences.Matroid theory is at the heart of combinatorial optimization and has attracted various pioneers such as Edmonds, Tutte, Cunningham and Lawler among others. Matroid theory encompasses matrices, graphs and other combinatorial entities under a common, solid algebraic framework, thereby providing the analytical tools to solve related difficult algorithmic problems. The monograph contains a rigorous axiomatic definition of matroids along with other necessary concepts such as duality, minors, connectivity and representability as demonstrated in matrices, graphs and transversals. The author also presents a deep decomposition result in matroid theory that provides  a structural characterization of graphic matroids, and show how this can be extended to signed-graphic matroids, as well as the immediate algorithmic consequences.  

Content Level » Research

Keywords » combinatorial geometries - combinatorial optimization - matroid theory - recognition algorithm - union algorithms

Related subjects » Computational Science & Engineering - Geometry & Topology

Table of contents 

1.Introduction.- 2.Graph Theory, Vector Spaces and Transversals.- 3.Definition of Matroids.- 4.Representability, Duality, Minors, and Connectivity.- 5. Decomposition of Graphic Matroids.- 6.Signed-Graphic Matroids.- List of Symbols.- Index.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Continuous Optimization.