Abstract
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex u is represented by a geometric object R(u) and in which each edge (u, v) is represented by the intersection between R(u) and R(v) if it belongs to a dense subgraph or by a curve connecting the boundaries of R(u) and R(v) otherwise. We study a notion of planarity, called Clique Planarity, for intersection-link representations of graphs in which the dense subgraphs are cliques.
Cite
CITATION STYLE
Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., & Rutter, I. (2015). Intersection-link representations of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9411, pp. 217–230). Springer Verlag. https://doi.org/10.1007/978-3-319-27261-0_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
