top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Descrizione fisica 1 online resource (XII, 237 p.)
Disciplina 511/.5
Collana Image Processing, Computer Vision, Pattern Recognition, and Graphics
Soggetto topico Geometry - Data processing
Graph theory - Data processing
ISBN 3-540-89550-7
Classificazione DAT 537f
MAT 052f
MAT 055f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNINA-9910483671203321
Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Descrizione fisica 1 online resource (XII, 237 p.)
Disciplina 511/.5
Collana Image Processing, Computer Vision, Pattern Recognition, and Graphics
Soggetto topico Geometry - Data processing
Graph theory - Data processing
ISBN 3-540-89550-7
Classificazione DAT 537f
MAT 052f
MAT 055f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNISA-996465425303316
Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui