Perfect Matchings: A Theory of Matching Covered Graphs: Algorithms and Computation in Mathematics, cartea 31
Autor Cláudio L. Lucchesi, U.S.R. Murtyen Limba Engleză Hardback – 6 apr 2024
A graph is matchable if it has a perfect matching. A matching covered graph is a connected graph on at least two vertices in which each edge is covered by some perfect matching. The theory of matching covered graphs, though of relatively recent vintage, has an array of interesting results with elegant proofs, several surprising applications and challenging unsolved problems.
The aim of this book is to present the material in a well-organized manner with plenty of examples and illustrations so as to make it accessible to undergraduates, and also to unify the existing theory and point out new avenues to explore so as to make it attractive to graduate students.
Din seria Algorithms and Computation in Mathematics
- 15%
Preț: 671.14 lei - 18%
Preț: 728.91 lei - 15%
Preț: 602.42 lei -
Preț: 488.92 lei - 15%
Preț: 643.00 lei -
Preț: 405.06 lei -
Preț: 402.00 lei - 18%
Preț: 738.69 lei -
Preț: 397.97 lei - 18%
Preț: 1121.13 lei - 15%
Preț: 497.22 lei - 20%
Preț: 656.36 lei - 15%
Preț: 479.22 lei -
Preț: 397.38 lei - 15%
Preț: 591.14 lei -
Preț: 393.35 lei - 20%
Preț: 330.42 lei - 18%
Preț: 962.35 lei - 23%
Preț: 638.32 lei - 15%
Preț: 596.55 lei -
Preț: 398.15 lei - 18%
Preț: 786.98 lei - 15%
Preț: 701.06 lei - 18%
Preț: 759.42 lei - 20%
Preț: 1153.97 lei - 20%
Preț: 341.48 lei -
Preț: 499.24 lei
Preț: 965.52 lei
Preț vechi: 1177.46 lei
-18% Nou
Puncte Express: 1448
Preț estimativ în valută:
184.78€ • 190.63$ • 156.38£
184.78€ • 190.63$ • 156.38£
Carte tipărită la comandă
Livrare economică 05-19 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031475030
ISBN-10: 3031475038
Ilustrații: XXIII, 580 p.
Dimensiuni: 155 x 235 mm
Greutate: 1.02 kg
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Algorithms and Computation in Mathematics
Locul publicării:Cham, Switzerland
ISBN-10: 3031475038
Ilustrații: XXIII, 580 p.
Dimensiuni: 155 x 235 mm
Greutate: 1.02 kg
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Algorithms and Computation in Mathematics
Locul publicării:Cham, Switzerland
Cuprins
Part I. Basic Theory.- Part II.- Brick and Brace Generation.- Part III.- Pfaffian Orientations.- A. Solutions to Selected Exercises.- References.- List of Figures.- Glossary.- Index.
Notă biografică
Cláudio Leonardo Lucchesi graduated from the University of Sao Paulo in 1968 with a degree in Electrical Engineering. He then went to the University of Waterloo in Canada with the intention of doing a doctorate in Computer Science. But, attracted by a conjectured minimax relation, he switched to graph theory, worked under the guidance of Daniel H Younger, and obtained his PhD degree in 1976. Returning to Brazil, he taught for a number of years in the Department of Computer Science at the State University of Campinas. After retirement in 2001, and after a short tenure at the Federal University of Mato Grosso do Sul, he is now happily back at his alma mater.
U.S.R. Murty learned graph theory from Professor Claude Berge and finished his PhD at the Indian Statistical Institute under the supervision of the well-known statistician Dr. C.R. Rao. He has been at the University of Waterloo, Canada, since 1967. He co-authored two books on graph theory with J.A. Bondy (Graph Theorywith Applications, Macmillan, 1976; and Graph Theory, Springer, 2008.
U.S.R. Murty learned graph theory from Professor Claude Berge and finished his PhD at the Indian Statistical Institute under the supervision of the well-known statistician Dr. C.R. Rao. He has been at the University of Waterloo, Canada, since 1967. He co-authored two books on graph theory with J.A. Bondy (Graph Theorywith Applications, Macmillan, 1976; and Graph Theory, Springer, 2008.
Textul de pe ultima copertă
Beginning with its origins in the pioneering work of W.T. Tutte in 1947, this monograph systematically traces through some of the impressive developments in matching theory.
A graph is matchable if it has a perfect matching. A matching covered graph is a connected graph on at least two vertices in which each edge is covered by some perfect matching. The theory of matching covered graphs, though of relatively recent vintage, has an array of interesting results with elegant proofs, several surprising applications and challenging unsolved problems.
The aim of this book is to present the material in a well-organized manner with plenty of examples and illustrations so as to make it accessible to undergraduates, and also to unify the existing theory and point out new avenues to explore so as to make it attractive to graduate students.
A graph is matchable if it has a perfect matching. A matching covered graph is a connected graph on at least two vertices in which each edge is covered by some perfect matching. The theory of matching covered graphs, though of relatively recent vintage, has an array of interesting results with elegant proofs, several surprising applications and challenging unsolved problems.
The aim of this book is to present the material in a well-organized manner with plenty of examples and illustrations so as to make it accessible to undergraduates, and also to unify the existing theory and point out new avenues to explore so as to make it attractive to graduate students.
Caracteristici
comprehensive monograph contains the most recent research Hot topic in graph theory