Inhaltsangabe
What is the essence of the similarity between forests in a graph and linearly independent sets of columns in a matrix? Why does the greedy algorithm produce a spanning tree of minimum weight in a connected graph? Is it possible to test in polynomial time whether a matrix is totally unimodular? These questions form the basis of Matroid theory. The study of matroids is a branch of discrete mathematics with basic links to graphs, lattices, codes, transversals, and projective geometries. Matroids are of fundamental importance in combinatorial optimization and their applications extend into electrical engineering and statics. This book falls into two parts: the first provides a comprehensive introduction to the basics of matroid theory, while the second treats more advanced topics. The book contains over five hundred exercises and includes, for the first time in one place, short proofs of all but one of the major theorems in the subject. The final chapter lists sixty unsolved problems and describes progress towards their solutions.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Críticas
"An excellent graduate textbook and reference work on matroid theory. It is an excellent first book on the subject due to its comprehensive nature. There is a wealth of material to mine for graduate students, graph theorists, and researchers in the area." --Mathematical Reviews "An excellent graduate textbook and reference work on matroid theory. It is an excellent first book on the subject due to its comprehensive nature. There is a wealth of material to mine for graduate students, graph theorists, and researchers in the area." --Mathematical Reviews "An excellent graduate textbook and reference work on matroid theory. It is an excellent first book on the subject due to its comprehensive nature. There is a wealth of material to mine for graduate students, graph theorists, and researchers in the area." --Mathematical Reviews "An excellent graduate textbook and reference work on matroid theory. It is an excellent first book on the subject due to its comprehensive nature. There is a wealth of material to mine for graduate students, graph theorists, and researchers in the area." --Mathematical Reviews
Reseña del editor
What is the essence of the similarity between forests in a graph and linearly independent sets of columns in a matrix? Why does the greedy algorithm produce a spanning tree of minimum weight in a connected graph? Is it possible to test in polynomial time whether a matrix is totally unimodular? These questions form the basis of Matroid theory. The study of matroids is a branch of discrete mathematics with basic links to graphs, lattices, codes, transversals, and projective geometries. Matroids are of fundamental importance in combinatorial optimization and their applications extend into electrical engineering and statics. This book falls into two parts: the first provides a comprehensive introduction to the basics of matroid theory, while the second treats more advanced topics. The book contains over five hundred exercises and includes, for the first time in one place, short proofs of all but one of the major theorems in the subject. The final chapter lists sixty unsolved problems and describes progress towards their solutions.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Matroid Theory (Oxford Graduate Texts in Mathematics)
Foto des Verkäufers
Matroid Theory
Verlag:
Oxford University Press, Oxford / New York / Tokyo, 1992
ISBN 10: 0198535635
ISBN 13: 9780198535638
Gebraucht
Hardcover
Erstausgabe
Anbieter: Bookworks [MWABA, IOBA], Beloit, WI, USA
Verkäuferbewertung 5 von 5 Sternen
Hard Cover. Zustand: Very Good. No Jacket. First Edition. Monograph on this branch of discrete mathematics, linked to "graphs, lattices, codes, transversals, and projective geometries." First edition (first printing), hardcover, as pictured; no jacket, as issyed. Light wear but bump to lower front edge, affecting the first 125 pages or so. Text clean; xi, blank, 532 pages; index, notation, references, figures, many equations, exercises, proofs, examples. Size: Large Octavo. Bestandsnummer des Verkäufers v0671
Beispielbild für diese ISBN
Matroid Theory (Oxford Graduate Texts in Mathematics)
Verlag:
Oxford University Press, 1993
ISBN 10: 0198535635
ISBN 13: 9780198535638
Gebraucht
Hardcover
Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Bestandsnummer des Verkäufers G0198535635I4N00