Discrete and Computational Geometry, Graphs, and Games
Springer International Publishing (Verlag)
978-3-032-00280-8 (ISBN)
This book, LNCS 14364, constitutes the refereed proceedings of the 24th Japanese Conference on Discrete and Computational Geometry and Graphs, JCDCGGG 2022, held virtually during September 9-11, 2022.
The 22 full papers included in this volume were carefully reviewed and selected from 35 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.
Memorial for Mari-Jo P. Ruiz ---A Colleague and Friend in Art and Math.- Mari-Jo P. Ruiz: Mathematician, Mentor, Leader.- Mari-Jo P. Ruiz and Graph Theory.- This Game Is Not Going To Analyze Itself.- Unveil the secret hidden in the Haberdasher's puzzle -Survey on Reversibility.- Multipartite Ramsey Numbers of Double Stars.- Counting $2$-factors of $4$-regular bipartite graphs is $#P$-complete.- The Two-Squirrel Problem and Its Relatives.- A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.- Complexity of Solo Chess with Unlimited Moves.- Stars in Forbidden Triples Generating a Finite Set of 4-connected Graphs.- Geodesic Paths Passing Through All Faces on A Polyhedron.- Partitions of complete twisted graphs into plane spanning trees.- The Edge-Intersection Graph of Induced Paths in a Graph.- All Paths Lead to Rome.- Numerically balanced dice on convex isohedra.- Nonrealizable Planar and Spherical Occlusion Diagrams.- Maximum numbers of rigid faces and edges in continuous flattening of regular polyhedra.- Find Routes on a Doughnut.- Previous Player's Positions in Impartial Three-Dimensional Chocolate-Bar Games with Constrained Chocolate Size.- Algorithms for Burning Schedule Reconfiguration Problem on Path Forests.- Continuous Folding of the Surface of a Hypercube onto one of its Facets.- Weights of Convex Quadrilaterals and Empty Triangles in Weighted Point Sets.- New Formulation for Coloring Circle Graphs.- On the Computational Complexity of Pushing Machine.
| Erscheinungsdatum | 24.07.2025 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XI, 428 p. 332 illus., 151 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
| Schlagworte | algorithms on geometric problems • Combinatorial Game Theory • complexity of geometric problems • complexity of graph problems • complexity of puzzles and games • Computational Geometry • Discrete Geometry • Graph Algorithms • graph theory • winning strategies of puzzles and games |
| ISBN-10 | 3-032-00280-X / 303200280X |
| ISBN-13 | 978-3-032-00280-8 / 9783032002808 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
