Perfect Matchings: A Theory of Matching Covered Graphs
Lucchesi, Cláudio L., Murty, U. S. R.
- 出版商: Springer
- 出版日期: 2024-04-06
- 售價: $6,660
- 貴賓價: 9.5 折 $6,327
- 語言: 英文
- 頁數: 580
- 裝訂: Hardcover - also called cloth, retail trade, or trade
- ISBN: 3031475038
- ISBN-13: 9783031475030
海外代購書籍(需單獨結帳)
相關主題
商品描述
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.商品描述(中文翻譯)
本書從W.T. Tutte在1947年的開創性工作開始,系統地追蹤了匹配理論中一些令人印象深刻的發展。圖形具有完美匹配時稱為可匹配。匹配覆蓋圖是一個至少有兩個頂點的連通圖,其中每條邊都被某個完美匹配覆蓋。匹配覆蓋圖的理論雖然相對較新,但具有一系列有趣的結果和優雅的證明,還有一些令人驚訝的應用和具有挑戰性的未解問題。
本書的目的是以井然有序的方式呈現材料,並提供大量的例子和插圖,以使本書對本科生易於理解,同時統一現有的理論並指出新的研究方向,以吸引研究生的興趣。
作者簡介
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.作者簡介(中文翻譯)
Cláudio Leonardo Lucchesi於1968年畢業於聖保羅大學,獲得電機工程學位。之後,他前往加拿大的滑鐵盧大學,原本打算攻讀計算機科學的博士學位。但是,受到一個關於極小極大關係的猜想吸引,他轉向圖論,在Daniel H Younger的指導下進行研究,並於1976年獲得博士學位。回到巴西後,他在坎皮納斯州立大學的計算機科學系任教多年。在2001年退休後,短暫在馬托格羅索聯邦大學任職後,現在他很高興地回到母校。
U.S.R. Murty從Claude Berge教授那裡學習了圖論,並在印度統計研究所在著名統計學家C.R. Rao的指導下完成了博士學位。自1967年以來,他一直在加拿大的滑鐵盧大學任職。他與J.A. Bondy合著了兩本關於圖論的書籍,分別是《應用圖論》(Macmillan,1976)和《圖論》(Springer,2008)。