Introduction to Graph Convexity
An Algorithmic Approach
Sorozatcím: Latin American Mathematics Series;
-
8% KEDVEZMÉNY?
- A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.
- Kiadói listaár EUR 64.19
-
27 229 Ft (25 932 Ft + 5% áfa)
Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.
- Kedvezmény(ek) 8% (cc. 2 178 Ft off)
- Discounted price 25 050 Ft (23 857 Ft + 5% áfa)
27 229 Ft
Beszerezhetőség
Még nem jelent meg, de rendelhető. A megjelenéstől számított néhány héten belül megérkezik.
Why don't you give exact delivery time?
A beszerzés időigényét az eddigi tapasztalatokra alapozva adjuk meg. Azért becsült, mert a terméket külföldről hozzuk be, így a kiadó kiszolgálásának pillanatnyi gyorsaságától is függ. A megadottnál gyorsabb és lassabb szállítás is elképzelhető, de mindent megteszünk, hogy Ön a lehető leghamarabb jusson hozzá a termékhez.
A termék adatai:
- Kiadó Springer
- Megjelenés dátuma 2025. június 13.
- Kötetek száma 1 pieces, Book
- ISBN 9783031841279
- Kötéstípus Keménykötés
- Terjedelem152 oldal
- Méret 235x155 mm
- Nyelv angol
- Illusztrációk 27 Illustrations, black & white; 20 Illustrations, color 700
Kategóriák
Rövid leírás:
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.
TöbbHosszú leírás:
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.
TöbbTartalomjegyzék:
Part I Fundamentals of Convexity in Graphs.- Basic Concepts of Convexity.- Convexity in Graphs.- Graph Convexity Parameters.- Convex Geometries in Graphs.- Part II Main Convexities and Applications.- P3 and P3* Convexities.- Geodesic Convexity.- Other Convexities.- Convexity in Oriental Graphs.- Applications in Graph Convexities.
Több
