buchspektrum Internet-Buchhandlung

Neuerscheinungen 2013

Stand: 2020-01-07
Schnellsuche
ISBN/Stichwort/Autor
Herderstraße 10
10625 Berlin
Tel.: 030 315 714 16
Fax 030 315 714 14
info@buchspektrum.de

Jin Akiyama, Mikio Kano, Toshinori Sakai (Beteiligte)

Computational Geometry and Graphs


Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected papers
Herausgegeben von Akiyama, Jin; Kano, Mikio; Sakai, Toshinori
2013. 2013. x, 163 S. 59 SW-Abb. 235 mm
Verlag/Jahr: SPRINGER, BERLIN 2013
ISBN: 3-642-45280-9 (3642452809)
Neue ISBN: 978-3-642-45280-2 (9783642452802)

Preis und Lieferzeit: Bitte klicken


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.
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.