Hoppa till sidans huvudinnehåll

Introduction to Graph Convexity

An Algorithmic Approach

919 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)


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.

Produktinformation

  • Utgivningsdatum2025-05-13
  • Mått155 x 235 x 15 mm
  • Vikt422 g
  • FormatInbunden
  • SpråkEngelska
  • SerieLatin American Mathematics Series
  • Antal sidor152
  • FörlagSpringer International Publishing AG
  • ISBN9783031841279
  • OriginaltitelUma introdução à convexidade em grafos
Hoppa över listan

Mer från samma serie

Luiz A. B. San Martin - Lie Groups, Inbunden

Lie Groups

Luiz A. B. San Martin

Inbunden, 2021

759 kr

Hoppa över listan

Du kanske också är intresserad av