Cantitate/Preț
Produs

Computational Geometry and Graphs: Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected papers: Lecture Notes in Computer Science, cartea 8296

Editat de Jin Akiyama, Mikio Kano, Toshinori Sakai
en Limba Engleză Paperback – 28 noi 2013
This book constitutes the refereed proceedings of the Thailand-Japan Joint Conference on Computational Geometry and Graphs, TJJCCGG 2012, held in Bangkok, Thailand, in December 2012.
The 15 original research papers presented were selected from among six plenary talks, one special public talk and 41 talks by participants from about 20 countries around the world. TJJCCGG 2012 provided a forum for researchers working in computational geometry, graph theory/algorithms and their applications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34157 lei

Preț vechi: 42695 lei
-20% Nou

Puncte Express: 512

Preț estimativ în valută:
6537 6896$ 5463£

Carte tipărită la comandă

Livrare economică 01-15 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642452802
ISBN-10: 3642452809
Pagini: 176
Ilustrații: X, 163 p. 59 illus.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.25 kg
Ediția:2013
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Operators which Preserve Reversibility.- Colored Quadrangulations with Steiner Points.- On Universal Point Sets for Planar Graphs.- On Non 3-Choosable Bipartite Graphs.- Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles.- Affine Classes of 3-Dimensional Parallelohedra - Their Parametrization.- On Complexity of Flooding Games on Graphs with Interval Representations.- How to Generalize Janken – Rock-Paper-Scissors-King-Flea.- Spanning Caterpillars Having at Most k Leaves.- GDDs with Two Associate Classes and with Three Groups of Sizes 1, n, n and λ1 < λ2.- The Number of Diagonal Transformations in Quadrangulations on the Sphere.- Remarks on Schur’s Conjecture.- Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks.- A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian.- On Simplifying Deformation of Smooth Manifolds Defined by Large Weighted Point Sets. 

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the Thailand-Japan Joint Conference on Computational Geometry and Graphs, TJJCCGG 2012, held in Bangkok, Thailand, in December 2012.
The 15 original research papers presented were selected from among six plenary talks, one special public talk and 41 talks by participants from about 20 countries around the world. TJJCCGG 2012 provided a forum for researchers working in computational geometry, graph theory/algorithms and their applications.

Caracteristici

High quality selected papers Unique visibility State of the art research