國立虎尾科技大學 |

Introduction to graph convexity = an algorithmic approach /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Introduction to graph convexity/ by Júlio Araújo ... [et al.].
Reminder of title:	an algorithmic approach /
other author:	Araújo, Júlio.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xv, 152 p. :ill. (some col.), digital ; : 24 cm.;
Contained By:	Springer Nature eBook
Subject:	Graph theory. -
Online resource:	https://doi.org/10.1007/978-3-031-84128-6
ISBN:	9783031841286

Introduction to graph convexity = an algorithmic approach /
introdução à convexidade em grafos.English

Introduction to graph convexityan algorithmic approach /[electronic resource] :by Júlio Araújo ... [et al.]. - Cham :Springer Nature Switzerland :2025. - xv, 152 p. :ill. (some col.), digital ;24 cm. - SBMAC collection on applied and computational mathematics. - SBMAC collection on applied and computational mathematics..

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.

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.

ISBN: 9783031841286

Standard No.: 10.1007/978-3-031-84128-6doiSubjects--Topical Terms:

527884
Graph theory.

LC Class. No.: QA166

Dewey Class. No.: 511.5

Introduction to graph convexity = an algorithmic approach /
LDR:02690nam a2200337 a 4500 001 1162522
003 DE-He213
005 20250512130303.0
006 m d
007 cr nn 008maaau
008 251029s2025 sz s 0 eng d
020 $a 9783031841286 $q (electronic bk.)
020 $a 9783031841279 $q (paper)
024 7 $a 10.1007/978-3-031-84128-6 $2 doi
035 $a 978-3-031-84128-6
040 $a GP $c GP
041 1 $a eng $h por
050 4 $a QA166
072 7 $a PBV $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.5 $2 23
090 $a QA166 $b .I61 2025
130 0 $a introdução à convexidade em grafos. $l English $3 1489320
245 1 0 $a Introduction to graph convexity $h [electronic resource] : $b an algorithmic approach / $c by Júlio Araújo ... [et al.].
260 $a Cham : $c 2025. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a xv, 152 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a SBMAC collection on applied and computational mathematics
505 0 $a 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.
520 $a 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.
650 0 $a Graph theory. $3 527884
650 0 $a Convex geometry. $3 685708
650 1 4 $a Graph Theory. $3 786670
650 2 4 $a Algorithms. $3 527865
700 1 $a Araújo, Júlio. $3 1489321
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a SBMAC collection on applied and computational mathematics. $3 1489322
856 4 0 $u https://doi.org/10.1007/978-3-031-84128-6
950 $a Mathematics and Statistics (SpringerNature-11649)