Articles liés à Introduction to Graph Convexity: An Algorithmic Approach
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Introduction to Graph Convexity: An Algorithmic Approach
Image d'archives
Introduction to Graph Convexity
impression à la demandeVendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783031841309
Acheter neuf
EUR 53,49
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Introduction to Graph Convexity : An Algorithmic Approach
impression à la demandeVendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783031841309
Acheter neuf
EUR 59,62
Expédition à EUR 35
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Introduction to Graph Convexity
Edité par
Springer Verlag GmbH, 2026
ISBN 10 : 3031841301
ISBN 13 : 9783031841309
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. N° de réf. du vendeur 2385394021
Acheter neuf
EUR 47,23
Expédition à EUR 48,99
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Introduction to Graph Convexity
impression à la demandeVendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783031841309
Acheter neuf
EUR 53,49
Expédition à EUR 60
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Introduction to Graph Convexity | An Algorithmic Approach
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 135780993
Acheter neuf
EUR 50,45
Expédition à EUR 70
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)