Some location problems on grid graphs
β Scribed by Tadashi Yamaguchi; Ikuo Kaji
- Book ID
- 112075596
- Publisher
- John Wiley and Sons
- Year
- 1987
- Tongue
- English
- Weight
- 564 KB
- Volume
- 70
- Category
- Article
- ISSN
- 8756-6621
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Abslract. Denote by @)(n; k) an ~-graph of n vcrtieca and k r-tuples. Turin's classical problem states: Detomline the smailcst integer f(n;r, I) so that cvcry G%; f(n; r, I)) contains a K@)(I). Tur&n determined f (n; r, I) for r = 2, but nothing is known for r > ?. Put lim,,f(n; t, O/(y) = c,,~ The
Hartman I.B.-A., I. Newman and R. Ziv, On grid intersection graphs, Discrete Mathematics 87 (1991) 41-52. A bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of horizontal and vertical segments in the plane, respectively, such that (xi, y,) E E if and only if segm