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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
James Oxley was born in Australia. After completing his undergraduate studies there, he received his doctorate from Oxford University in 1978 under the supervision of Dominic Welsh. After a postdoctoral position at the Australian National University and a Fulbright Postdoctoral Fellowship at the University of North Carolina, he began working at Louisiana State University in 1982. He has been an Alumni Professor there since 1999. He has written more than one hundred research papers in matroid theory and graph theory and has given over fifty conference talks including plenary addresses at the British Combinatorial Conference in 2001 and an American Mathematical Society meeting in 2002. Fourteen students have completed doctorates under his supervision and he is currently advising five other doctoral candidates. In 1999, he was named LSU's Distinguished Research Master for Engineering, Science, and Technology. From April until July 2005, he was a Visiting Research Fellow at Merton College, Oxford.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 22,25 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : Bookworks [MWABA, IOBA], Beloit, WI, Etats-Unis
Hard Cover. Etat : 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. N° de réf. du vendeur v0671
Quantité disponible : 1 disponible(s)
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
Hardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.15. N° de réf. du vendeur G0198535635I4N00
Quantité disponible : 1 disponible(s)