rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Computational Geometry and Graph Theory
    sub title: International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers
  name:
    name part: Ito, Hiro.
    role:
      role term: editor.
  name:
    name part: Kano, Mikio.
    role:
      role term: editor.
  name:
    name part: Katoh, Naoki.
    role:
      role term: editor.
  name:
    name part: Uno, Yushi.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2008
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 237 p. online resource.
  abstract: 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 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.
  table of contents: 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.
  note: edited by Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno.
  subject:
    topic: Computer science
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Algorithms
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer graphics
  subject:
    topic: Convex geometry
  subject:
    topic: Discrete geometry
  subject:
    topic: Computer Science
  subject:
    topic: Computer Graphics
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Data Structures
  subject:
    topic: Convex and Discrete Geometry
  classification: T385
  classification: 006.6
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 4535
  identifier: 9783540895503
  identifier: http://dx.doi.org/10.1007/978-3-540-89550-3
  record info:
    record creation date: 100301
    record change date: 20170131061814.0
    record identifier: 978-3-540-89550-3