Afhalen na 1 uur in een winkel met voorraad
Gratis thuislevering in België vanaf € 30
Ruim aanbod met 7 miljoen producten

Afhalen na 1 uur in een winkel met voorraad
Gratis thuislevering in België vanaf € 30
Ruim aanbod met 7 miljoen producten

Winkels

Verlanglijstje

Winkels

Verlanglijstje

Zoeken

Volg ons op

140 winkels

Wist je dat er in Vlaanderen voor iedereen een Standaard Boekhandel is binnen een straal van 7 km?

Vind hier een winkel

€ 63,45

+ 126 punten

Levertermijn 1 à 4 weken

Eenvoudig bestellen

Veilig betalen

Gratis thuislevering vanaf € 30 (via bpost)

Gratis levering in je Standaard Boekhandel

Omschrijving

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.