Computational Geometry and Graph Theory International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Ito, Hiro (Επιμελητής έκδοσης), Kano, Mikio (Επιμελητής έκδοσης), Katoh, Naoki (Επιμελητής έκδοσης), Uno, Yushi (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
• Σειρά: Lecture Notes in Computer Science, 4535
• Θέματα: Computer science.; Data structures (Computer science).; Algorithms.; Computer science > Mathematics.; Computer graphics.; Convex geometry.; Discrete geometry.; Computer Science.; Computer Graphics.; Discrete Mathematics in Computer Science.; Algorithm Analysis and Problem Complexity.; Data Structures.; Convex and Discrete Geometry.

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 Vašek Chvátal, on the occasion of their 60th birthdays. The 19 revised full pa...

Πίνακας περιεχομένων:

• 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átal–Erd?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.