Matroid Theory and its Applications in Electric Network Theory and in Statics

  • András Recski

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

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Part One

    1. Front Matter
      Pages 1-1
    2. András Recski
      Pages 3-36
    3. András Recski
      Pages 37-68
    4. András Recski
      Pages 69-91
    5. András Recski
      Pages 92-106
    6. András Recski
      Pages 107-130
    7. András Recski
      Pages 131-147
  3. Part Two

    1. Front Matter
      Pages 149-149
    2. András Recski
      Pages 151-170
    3. András Recski
      Pages 171-184
    4. András Recski
      Pages 206-221
    5. András Recski
      Pages 222-232
    6. András Recski
      Pages 233-246
    7. András Recski
      Pages 247-259
    8. András Recski
      Pages 260-272
    9. András Recski
      Pages 273-286
    10. András Recski
      Pages 287-292
    11. András Recski
      Pages 293-306
    12. András Recski
      Pages 307-316
  4. Back Matter
    Pages 317-533

About this book


I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some gen­ eral tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has in­ creased with the spread of computers. Classical analysis did not even consider problems where "only" a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in con­ siderable detail. Some questions of this type (for example, the determination of when the so called "greedy" algorithm is optimal) cannot even be answered without matroidal tools.


algorithm algorithms combinatorics computer discrete mathematics network statics

Authors and affiliations

  • András Recski
    • 1
  1. 1.Eötvös Loránd UniversityBudapest VIIIHungary

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1989
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-662-22145-7
  • Online ISBN 978-3-662-22143-3
  • Series Print ISSN 0937-5511
  • Buy this book on publisher's site