Matroid Theory and its Applications in Electric Network Theory and in Statics (Algorithms and Combinatorics)

Andras Recski

ISBN 10: 3662221454 / ISBN 13: 9783662221457

Published by Springer, 2013

About this Item

reprint edition. 548 pages. 9.61x6.69x1.24 inches. In Stock.

Seller Inventory # x-3662221454

Bibliographic Details

• Title: Matroid Theory and its Applications in Electric Network Theory and in Statics (Algorithms and Combinatorics)
• Publisher: Springer
• Publication Date: 2013
• Language: English
• ISBN 10: 3662221454
• ISBN 13: 9783662221457
• Binding: Paperback
• Condition: Brand New
• Weight: 0.94 kilograms

About this title

Synopsis

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.