Matroid Theory and its Applications in Electric Network Theory and in Statics
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 d...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1989, 1989
|
| Edition: | 1st ed. 1989 |
| Series: | Algorithms and Combinatorics
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- ONE
- 1 Basic concepts from graph theory
- 2 Applications
- 3 Planar graphs and duality
- 4 Applications
- 5 The theorems of König and Menger
- 6 Applications
- TWO
- 7 Basic concepts in matroid theory
- 8 Applications
- 9 Algebraic and geometric representation of matroids
- 10 Applications
- 11 The sum of matroids I
- 12 Applications
- 13 The sum of matroids II
- 14 Applications
- 15 Matroids induced by graphs
- 16 Applications
- 17 Some recent results in matroid theory
- 18 Applications
- Appendix 1 Some important results in chronological order
- Appendix 2 List of the Boxes
- Appendix 3 List of the Algorithms
- Appendix 4 Solutions to the Exercises and Problems