Computational Geometry and Graphs
Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected papers
(Sprache: Englisch)
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...
The 15 original research papers presented were selected from among six...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
60.49 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Computational Geometry and Graphs “
Klappentext zu „Computational Geometry and Graphs “
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.
Inhaltsverzeichnis zu „Computational Geometry and Graphs “
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.
Bibliographische Angaben
- 2013, 2013, X, 163 Seiten, Maße: 15,6 x 23,6 cm, Kartoniert (TB), Englisch
- Herausgegeben: Jin Akiyama, Mikio Kano, Toshinori Sakai
- Verlag: Springer, Berlin
- ISBN-10: 3642452809
- ISBN-13: 9783642452802
Sprache:
Englisch
Kommentar zu "Computational Geometry and Graphs"
Schreiben Sie einen Kommentar zu "Computational Geometry and Graphs".
Kommentar verfassen