LEADER 04824nam 22008655 450 001 9910483671203321 005 20251226202939.0 010 $a3-540-89550-7 024 7 $a10.1007/978-3-540-89550-3 035 $a(CKB)1000000000545782 035 $a(SSID)ssj0000316774 035 $a(PQKBManifestationID)11244302 035 $a(PQKBTitleCode)TC0000316774 035 $a(PQKBWorkID)10276058 035 $a(PQKB)10600457 035 $a(DE-He213)978-3-540-89550-3 035 $a(MiAaPQ)EBC3063785 035 $a(MiAaPQ)EBC6706200 035 $a(Au-PeEL)EBL6706200 035 $a(PPN)130186198 035 $a(EXLCZ)991000000000545782 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputational Geometry and Graph Theory $eInternational Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers /$fedited by Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XII, 237 p.) 225 1 $aImage Processing, Computer Vision, Pattern Recognition, and Graphics,$x3004-9954 ;$v4535 300 $a"Kyoto Conference on Computational Geometry and Graph Theory (KyotoCGGT 2007)"--Pref. 311 08$a3-540-89549-3 320 $aIncludes bibliographical references and index. 327 $aDudeney 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. 330 $aThis 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 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. 410 0$aImage Processing, Computer Vision, Pattern Recognition, and Graphics,$x3004-9954 ;$v4535 606 $aComputer graphics 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aConvex geometry 606 $aDiscrete geometry 606 $aComputer Graphics 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aData Science 606 $aConvex and Discrete Geometry 615 0$aComputer graphics. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aConvex geometry. 615 0$aDiscrete geometry. 615 14$aComputer Graphics. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aConvex and Discrete Geometry. 676 $a511/.5 686 $aDAT 537f$2stub 686 $aMAT 052f$2stub 686 $aMAT 055f$2stub 686 $aSS 4800$2rvk 702 $aIto$b Hiro 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483671203321 996 $aComputational Geometry and Graph Theory$9774070 997 $aUNINA