Algorithms and Combinatorics

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

Authors: Recski, Andras

Free Preview

Buy this book

eBook 85,59 €
price for Spain (gross)
  • ISBN 978-3-662-22143-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • Immediate eBook download after purchase and usable on all devices
  • Bulk discounts available
Softcover 103,99 €
price for Spain (gross)
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.

Table of contents (18 chapters)

Table of contents (18 chapters)

Buy this book

eBook 85,59 €
price for Spain (gross)
  • ISBN 978-3-662-22143-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • Immediate eBook download after purchase and usable on all devices
  • Bulk discounts available
Softcover 103,99 €
price for Spain (gross)
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Matroid Theory and its Applications in Electric Network Theory and in Statics
Authors
Series Title
Algorithms and Combinatorics
Series Volume
6
Copyright
1989
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-662-22143-3
DOI
10.1007/978-3-662-22143-3
Softcover ISBN
978-3-662-22145-7
Series ISSN
0937-5511
Edition Number
1
Number of Pages
XIII, 533
Additional Information
Jointly published with Akademiai Kiado, Budapest, Hungary
Topics