000 04457nam a22006495i 4500
001 978-3-540-89550-3
003 DE-He213
005 20240423125932.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540895503
_9978-3-540-89550-3
024 7 _a10.1007/978-3-540-89550-3
_2doi
050 4 _aT385
072 7 _aUML
_2bicssc
072 7 _aCOM012000
_2bisacsh
072 7 _aUML
_2thema
082 0 4 _a006.6
_223
245 1 0 _aComputational Geometry and Graph Theory
_h[electronic resource] :
_bInternational Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers /
_cedited by Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXII, 237 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aImage Processing, Computer Vision, Pattern Recognition, and Graphics,
_x3004-9954 ;
_v4535
505 0 _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.
520 _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.
650 0 _aComputer graphics.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aConvex geometry .
650 0 _aDiscrete geometry.
650 1 4 _aComputer Graphics.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithms.
650 2 4 _aData Science.
650 2 4 _aConvex and Discrete Geometry.
700 1 _aIto, Hiro.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKano, Mikio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKatoh, Naoki.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aUno, Yushi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540895497
776 0 8 _iPrinted edition:
_z9783540895862
830 0 _aImage Processing, Computer Vision, Pattern Recognition, and Graphics,
_x3004-9954 ;
_v4535
856 4 0 _uhttps://doi.org/10.1007/978-3-540-89550-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c183278
_d183278