Cantitate/Preț
Produs
Total produse
Vezi coșul
Discrete and Computational Geometry, Graphs, and Games de Jin Akiyama

Discrete and Computational Geometry, Graphs, and Games: Lecture Notes in Computer Science, cartea 13034

Editat de Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno
en Limba Engleză Paperback – 29 oct 2021
This book constitutes the thoroughly refereed post-conference proceedings of the 21st Japanese Conference on Discrete and Computational Geometry and Graphs, JCDCGGG 2018, held in Quezon City, Philippines, in September 2018.
The total of 14 papers included in this volume was carefully reviewed and selected from 25 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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34448 lei

Preț vechi: 43060 lei
-20%

Puncte Express: 517
Preț estimativ în valută:
6091€ • 6985$ • 5265£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030900472
ISBN-10: 3030900479
Pagini: 200
Ilustrații: X, 187 p. 90 illus., 63 illus. in color.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.31 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

On Geometric Graphs on Point Sets in the Plane.- The Two-distance Sets in Dimension Four.- Negative Instance for the Edge Patrolling Beacon Problem.- Global Location-Domination in the Join and Cartesian Product of Graphs.- The Metric Dimension of the Join of Paths and Cycles.- Barnette’s Conjecture Through the Lens of the ModkP Complexity Classes.- Amiltonicity of graphs on surfaces in terms of toughness and scattering number – A survey.- On Structural Parameterizations of Node Kayles.- Robustness in power-law kinetic systems with reactant-determined interactions.- Toward Unfolding Doubly Covered n-Stars.- Crystallographic Flat Origami from n-Uniform Tilings.- Packing Cube Nets into Rectangles with O(1) Holes.- On the Complexity of Jelly-no-Puzzle.- Computational Complexity of Two Pencil Puzzles.