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.
Combinatorial geometry and graph theory : Indonesia-Japan joint conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003 : revised selected papers / / Jin Akiyama, Edy Tri Baskoro, Mikio Kano (eds.)
| Combinatorial geometry and graph theory : Indonesia-Japan joint conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003 : revised selected papers / / Jin Akiyama, Edy Tri Baskoro, Mikio Kano (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (VIII, 227 p.) |
| Disciplina | 516/.13 |
| Altri autori (Persone) |
AkiyamaJ
BaskoroEdy Tri KanoMikio <1949-> |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Combinatorial geometry
Graph theory |
| ISBN |
3-540-30540-8
3-540-24401-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On Convex Developments of a Doubly-Covered Square -- Flat 2-Foldings of Convex Polygons -- Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph -- Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles -- Maximum Induced Matchings of Random Regular Graphs -- Antimagic Valuations for the Special Class of Plane Graphs -- A General Framework for Coloring Problems: Old Results, New Results, and Open Problems -- Crossing Numbers and Skewness of Some Generalized Petersen Graphs -- Some Conditions for the Existence of (d,k)-Digraphs -- Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs -- On a Triangle with the Maximum Area in a Planar Point Set -- A Balanced Interval of Two Sets of Points on a Line -- Spanning Trees of Multicoloured Point Sets with Few Intersections -- Regular Factors Containing a Given Hamiltonian Cycle -- Disjoint Edges in Topological Graphs -- The Decycling Number of Cubic Graphs -- Equal Area Polygons in Convex Bodies -- Maximum Order of Planar Digraphs -- (a,d)-Edge-Antimagic Total Labelings of Caterpillars -- An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels -- Constructions for Nonhamiltonian Burkard-Hammer Graphs -- A Characterization of Polygonal Regions Searchable from the Boundary -- ?-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One. |
| Altri titoli varianti | IJCCGGT 2003 |
| Record Nr. | UNINA-9910483030203321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete and computational geometry : Japanese conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 : revised selected papers / / Jin Akiyama, Mikio Kano, Xuehou Tan (eds.)
| Discrete and computational geometry : Japanese conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 : revised selected papers / / Jin Akiyama, Mikio Kano, Xuehou Tan (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (VIII, 213 p.) |
| Disciplina | 516/.11 |
| Altri autori (Persone) |
AkiyamaJ
KanoMikio <1949-> TanXuehou |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Combinatorial geometry
Geometry - Data processing |
| ISBN |
3-540-32089-X
3-540-30467-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Matching Points with Circles and Squares -- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation -- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs -- Sliding Disks in the Plane -- Weighted Ham-Sandwich Cuts -- Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane -- Farthest-Point Queries with Geometric and Combinatorial Constraints -- Grid Vertex-Unfolding Orthostacks -- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem -- Tight Time Bounds for the Minimum Local Convex Partition Problem -- I/O-Efficiently Pruning Dense Spanners -- On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons -- Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon -- Wedges in Euclidean Arrangements -- Visual Pascal Configuration and Quartic Surface -- Nonexistence of 2-Reptile Simplices -- Single-Vertex Origami and Spherical Expansive Motions -- An Optimal Algorithm for the 1-Searchability of Polygonal Rooms -- Crossing Stars in Topological Graphs -- The Geometry of Musical Rhythm. |
| Altri titoli varianti | JCDCG 2004 |
| Record Nr. | UNINA-9910484985903321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||