Graduate students and researchers in combinatorics and matroid theory as well as computer scientists, graph theorists and scientific libraries may find this book useful. Matroids were introduced in 1935 as an abstract generalization of graphs and matrices. Since the mid-1950s, much progress has been made, and there now exists a large collection of significant matroid theorems. Matroid decomposition covers the area of the theory dealing with decomposition and composition of matroids. In order to make the subject more accessible to those without a background in matroid theory, the book starts with introductory material. The exposition is clear and simple, making the main results easily understandable.
"synopsis" may belong to another edition of this title.
K. Truemper obtained in 1973 a PhD in Operations Research at Case Western University. Since then he has been on the faculty of the University of Texas at Dallas and currently is Professor Emeritus of Computer Science.
"About this title" may belong to another edition of this title.
Book Description Academic Pr, 1992. Hardcover. Book Condition: New. book. Bookseller Inventory # 127012257
Book Description Academic Pr, 1992. Hardcover. Book Condition: New. book. Bookseller Inventory # 0127012257
Book Description Academic Pr, 1992. Hardcover. Book Condition: New. Bookseller Inventory # SONG0127012257
Book Description Book Condition: Brand New. Book Condition: Brand New. Bookseller Inventory # 97801270122541.0