Items related to Introduction to Graph Convexity: An Algorithmic Approach...
Introduction to Graph Convexity: An Algorithmic Approach (Latin American Mathematics Series) - Softcover
Synopsis
This book focuses on the computational aspects of graph convexity, with a particular emphasis on path convexity within graphs. It provides a thoughtful introduction to this emerging research field, which originated by adapting concepts from convex geometry to combinatorics and has experienced substantial growth.
The book starts with an introduction of fundamental convexity concepts and then proceeds to discuss convexity parameters. These parameters fall into two categories: one derived from abstract convexity studies and another motivated by computational complexity. Subsequent chapters explore geometric convexity within graphs, examining various graph classes such as interval graphs, proper interval graphs, cographs, chordal graphs, and strongly chordal graphs. The text concludes with a study of the computation of convexity parameters across different convexity types, including practical applications in areas like game theory.
Compact and straightforward, this work serves as an ideal entry point for students and researchers interested in pursuing further research in the field of convexity.
The English translation of this book, originally in Portuguese, was facilitated by artificial intelligence. The content was later revised by the authors for accuracy.
"synopsis" may belong to another edition of this title.
About the Author
Júlio Araújo is a Professor at the Federal University of Ceará, Brazil. He holds a Master's degree (2009) and a PhD (2012) in Computer Science from the same University, with post-doc studies at the Centre de Recherche INRIA Sophia Antipolis and the Laboratoire d'Informatique, Robotique et Microélectronique de Montpellier, both in France.
Mitre C. Dourado is an Associate Professor at the Federal University of Rio de Janeiro, Brazil. He did his Master's (2001) and PhD (2005) studies at the same University and did post-doc studies at the Université Paris 13 (Paris-Nord), France.
Fábio Protti is a Full Professor at the Fluminense Federal University, Brazil. He holds Master's (1993) and PhD (1998) degrees in Systems Engineering and Computing from the Federal University of Rio de Janeiro, Brazil.
Rudini M. Sampaio is a Full Professor at the Federal University of Ceará, Brazil. He holds a Master's degree (2000) from the same university and a PhD (2008) from the University of Săo Paulo.
From the Back Cover
This book focuses on the computational aspects of graph convexity, with a particular emphasis on path convexity within graphs. It provides a thoughtful introduction to this emerging research field, which originated by adapting concepts from convex geometry to combinatorics and has experienced substantial growth.
The book starts with an introduction of fundamental convexity concepts and then proceeds to discuss convexity parameters. These parameters fall into two categories: one derived from abstract convexity studies and another motivated by computational complexity. Subsequent chapters explore geometric convexity within graphs, examining various graph classes such as interval graphs, proper interval graphs, cographs, chordal graphs, and strongly chordal graphs. The text concludes with a study of the computation of convexity parameters across different convexity types, including practical applications in areas like game theory.
Compact and straightforward, this work serves as an ideal entry point for students and researchers interested in pursuing further research in the field of convexity.
The English translation of this book, originally in Portuguese, was facilitated by artificial intelligence. The content was later revised by the authors for accuracy.
"About this title" may belong to another edition of this title.
Search results for Introduction to Graph Convexity: An Algorithmic Approach...
Stock Image
Introduction to Graph Convexity
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book focuses on the computational aspects of graph convexity, with a particular emphasis on path convexity within graphs. It provides a thoughtful introduction to this emerging research field, which originated by adapting concepts from convex geometry to combinatorics and has experienced substantial growth.The book starts with an introduction of fundamental convexity concepts and then proceeds to discuss convexity parameters. These parameters fall into two categories: one derived from abstract convexity studies and another motivated by computational complexity.Subsequent chapters explore geometric convexity within graphs, examining various graph classes such as interval graphs, proper interval graphs, cographs, chordal graphs, and strongly chordal graphs. The textconcludes with a study of the computation of convexity parameters across different convexity types, including practical applications in areas like game theory.Compact and straightforward, this work serves as an ideal entry point for students and researchers interested in pursuing further research in the field of convexity.The English translation of this book, originally in Portuguese, was facilitated by artificial intelligence. The content was later revised by the authors for accuracy. 168 pp. Englisch. Seller Inventory # 9783031841309
Buy New
US$ 62.75
US$ 26.20 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Introduction to Graph Convexity : An Algorithmic Approach
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book focuses on the computational aspects of graph convexity, with a particular emphasis on path convexity within graphs. It provides a thoughtful introduction to this emerging research field, which originated by adapting concepts from convex geometry to combinatorics and has experienced substantial growth.The book starts with an introduction of fundamental convexity concepts and then proceeds to discuss convexity parameters. These parameters fall into two categories: one derived from abstract convexity studies and another motivated by computational complexity.Subsequent chapters explore geometric convexity within graphs, examining various graph classes such as interval graphs, proper interval graphs, cographs, chordal graphs, and strongly chordal graphs. The textconcludes with a study of the computation of convexity parameters across different convexity types, including practical applications in areas like game theory.Compact and straightforward, this work serves as an ideal entry point for students and researchers interested in pursuing further research in the field of convexity.The English translation of this book, originally in Portuguese, was facilitated by artificial intelligence. The content was later revised by the authors for accuracy. Seller Inventory # 9783031841309
Buy New
US$ 69.95
US$ 39.87 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Introduction to Graph Convexity
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Seller Inventory # 2385394021
Buy New
US$ 55.42
US$ 55.80 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Introduction to Graph Convexity
Print on DemandSeller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book focuses on the computational aspects of graph convexity, with a particular emphasis on path convexity within graphs. It provides a thoughtful introduction to this emerging research field, which originated by adapting concepts from convex geometry to combinatorics and has experienced substantial growth.The book starts with an introduction of fundamental convexity concepts and then proceeds to discuss convexity parameters. These parameters fall into two categories: one derived from abstract convexity studies and another motivated by computational complexity. Subsequent chapters explore geometric convexity within graphs, examining various graph classes such as interval graphs, proper interval graphs, cographs, chordal graphs, and strongly chordal graphs. The text concludes with a study of the computation of convexity parameters across different convexity types, including practical applications in areas like game theory.Compact and straightforward, this work serves as an ideal entry point for students and researchers interested in pursuing further research in the field of convexity.The English translation of this book, originally in Portuguese, was facilitated by artificial intelligence. The content was later revised by the authors for accuracy. 168 pp. Englisch. Seller Inventory # 9783031841309
Buy New
US$ 62.75
US$ 68.35 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Introduction to Graph Convexity | An Algorithmic Approach
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Introduction to Graph Convexity | An Algorithmic Approach | Júlio Araújo (u. a.) | Taschenbuch | Latin American Mathematics Series | xv | Englisch | 2026 | Springer | EAN 9783031841309 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 135780993
Buy New
US$ 59.19
US$ 79.74 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available