Zobrazeno 1 - 10 of 13 pro vyhledávání: '"Alice M. Dean"'
1
Bar k-Visibility Graphs
Autor: MohammadAli Safari, William T. Trotter, Joshua D. Laison, Alice M. Dean, Ellen Gethner, William S. Evans
Publikováno v: Journal of Graph Algorithms and Applications. 11:45-59
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one correspondence between vertices of G and bars in S, such that there is a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ea9e4dff90cb03127acf0c4389080a04
https://doi.org/10.7155/jgaa.00136
Zobrazit plný text záznamu
2
Review of visibility algorithms in the plane by Subir Kumar Ghosh (Cambridge University Press, 2007)
Autor: Alice M. Dean
Publikováno v: ACM SIGACT News. 40:33-35
Computational Geometry is a young field, tracing its beginnings to the PhD thesis of Michael Shamos [6] in 1978. Its many applications include, to name a few, computer graphics and imaging, robotics and computer vision, and geometric information syst
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::fc2fc2e1cbf1b54cf60a1f2d663146ce
https://doi.org/10.1145/1556154.1556163
Zobrazit plný text záznamu
3
Rectangle-visibility Layouts of Unions and Products of Trees
Autor: Alice M. Dean, Joan P. Hutchinson
Publikováno v: Journal of Graph Algorithms and Applications. 2:1-21
The paper considers representations of unions and products of trees as rectangle-visibility graphs (abbreviated RVGs), i.e., graphs whose vertices are rectangles in the plane, with adjacency determined by horizontal and vertical visibility. Our main
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c9ed5db364bea12f5ba839da4f09afcf
https://doi.org/10.7155/jgaa.00011
Zobrazit plný text záznamu
4
Rectangle-visibility representations of bipartite graphs
Autor: Joan P. Hutchinson, Alice M. Dean
Publikováno v: Discrete Applied Mathematics. 75:9-25
The paper considers representations of bipartite graphs as rectangle-visibility graphs , i.e., graphs whose vertices are rectangles in the plane, with adjacency determined by horizontal and vertical visibility. It is shown that, for p ⩽ q , K p , q
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55065358279800254f6c744d9e858cdc
https://doi.org/10.1016/s0166-218x(96)00029-7
Zobrazit plný text záznamu
6
Posets of Geometric Graphs
Autor: Andrei Margea, Alice M. Dean, Debra L. Boutin, Sally Cockburn
A geometric graph G(bar) is a simple graph drawn in the plane, on points in general position, with straight-line edges. We call G(bar) a geometric realization of the underlying abstract graph G. A geometric homomorphism is a vertex map that preserves
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::309ceb97c4a40a301de0c318b02c6219
http://arxiv.org/abs/1107.1131
Zobrazit plný text záznamu
7
On the thickness and arboricity of a graph
Autor: Edward R. Scheinerman, Joan P. Hutchinson, Alice M. Dean
Publikováno v: Journal of Combinatorial Theory, Series B. 52(1):147-151
We prove that the thickness and the arboricity of a graph with e edges are at most ⌊e3 + 32⌋ and ⌈e2⌉, respectively, and that the latter bound is best possible.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16f8f15f3e4a02ede6ead8d9ac4b402b
Zobrazit plný text záznamu
8
Unit Rectangle Visibility Graphs
Autor: Joanna A. Ellis-Monaghan, Sarah Hamilton, Greta Pangborn, Alice M. Dean
Over the past twenty years, rectangle visibility graphs have generated considerable interest, in part due to their applicability to VLSI chip design. Here we study unit rectangle visibility graphs, with fixed dimension restrictions more closely model
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fca0b3b1ddf834916d1655824015049
http://arxiv.org/abs/0710.2279
Zobrazit plný text záznamu
9
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
Autor: Joshua D. Laison, Ellen Gethner, MohammadAli Safari, Alice M. Dean, William T. Trotter, William S. Evans
Publikováno v: Graph Drawing ISBN: 9783540314257
Graph Drawing
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one correspondence between vertices of G and bars in S, such that there is a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::34c1a15277b92bc7e549867a8383616e
https://doi.org/10.1007/11618058_7
Zobrazit plný text záznamu
10
Unit Bar-Visibility Layouts of Triangulated Polygons
Autor: Joan P. Hutchinson, Ellen Gethner, Alice M. Dean
Publikováno v: Graph Drawing ISBN: 9783540245285
Graph Drawing
A triangulated polygon is a 2-connected maximal outerplanar graph. A unit bar-visibility graph (UBVG for short) is a graph whose vertices can be represented by disjoint, horizontal, unit-length bars in the plane so that two vertices are adjacent if a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c7934881da00bfdfe25176b2ad275d50
https://doi.org/10.1007/978-3-540-31843-9_13
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje