Atnaujinkite slapukų nuostatas

Computational Geometry and Graph Theory: International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers 2008 ed. [Minkštas viršelis]

Edited by , Edited by , Edited by , Edited by
  • Formatas: Paperback / softback, 237 pages, aukštis x plotis: 235x155 mm, weight: 454 g, XII, 237 p., 1 Paperback / softback
  • Serija: Lecture Notes in Computer Science 4535
  • Išleidimo metai: 13-Nov-2008
  • Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540895493
  • ISBN-13: 9783540895497
  • Formatas: Paperback / softback, 237 pages, aukštis x plotis: 235x155 mm, weight: 454 g, XII, 237 p., 1 Paperback / softback
  • Serija: Lecture Notes in Computer Science 4535
  • Išleidimo metai: 13-Nov-2008
  • Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540895493
  • ISBN-13: 9783540895497
This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007, in honor of Jin Akiyama and Vaek Chvįtal, on the occasion of their 60th birthdays. The 19 revised full papers, presented together with 5 invited papers, were carefully selected during two rounds of reviewing and improvement from more than 60 talks at the conference. All aspects of Computational Geometry and Graph Theory are covered, including tilings, polygons, impossible objects, coloring of graphs, Hamilton cycles, and factors of graphs.
Dudeney Transformation of Normal Tiles.- Chromatic Numbers of Specified
Isohedral Tilings.- Transforming Graphs with the Same Degree Sequence.- The
Forest Number of (n,m)-Graphs.- Computing Simple Paths on Points in Simple
Polygons.- Deflating the Pentagon.- Enumeration of Polyominoes, Polyiamonds
and Polyhexes for Isohedral Tilings with Rotational Symmetry.- Solvable
Trees.- Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle.- A
Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets.- Fast
Skew Partition Recognition.- Some Results on Fractional Graph Theory.- Seven
Types of Random Spherical Triangle in S n and Their Probabilities.-
(3,2)-Track Layout of Bipartite Graph Subdivisions.- Bartholdi Zeta Functions
of Branched Coverings of Digraphs.- On Super Edge-Magic Strength and
Deficiency of Graphs.- The Number of Flips Required to Obtain Non-crossing
Convex Cycles.- Divide and Conquer Method for k-Set Polygons.- Coloring
Axis-Parallel Rectangles.- Domination in Cubic Graphs of Large Girth.-
ChvįtalErd?s Theorem: Old Theorem with New Aspects.- Computer-Aided Creation
of Impossible Objects and Impossible Motions.- The Hamiltonian Number of
Cubic Graphs.- SUDOKU Colorings of the Hexagonal Bipyramid Fractal.