Cláudio L. Lucchesi - Böcker
Visar alla böcker från författaren Cláudio L. Lucchesi. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
Del 31 - Algorithms and Computation in Mathematics
Perfect Matchings
A Theory of Matching Covered Graphs
Inbunden, Engelska, 2024
1 578 kr
Skickas inom 10-15 vardagar
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.
Del 31 - Algorithms and Computation in Mathematics
Perfect Matchings
A Theory of Matching Covered Graphs
Häftad, Engelska, 2025
1 578 kr
Skickas inom 10-15 vardagar
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.
LATIN'98: Theoretical Informatics
Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, Proceedings
Häftad, Engelska, 1998
552 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the Third Latin American Symposium on Theoretical Informatics, LATIN'98, held in Campinas, Brazil, in April 1998.The 28 revised full papers presented together with five invited surveys were carefully selected from a total of 53 submissions based on 160 referees' reports. The papers are organized in sections on algorithms and complexity; automata, transition systems and combinatorics on words; computational geometry and graph drawing; cryptography; graph theory and algorithms on graphs; packet routing; parallel algorithms; and pattern matching and browsing.