Intersection-Link Representations of Graphs

Angelini, Patrizio and Da Lozzo, Giordano and Di Battista, Giuseppe and Frati, Fabrizio and Patrignani, Maurizio and Rutter, Ignaz (2015) Intersection-Link Representations of Graphs. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 217-230(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_19).

Full text not available from this repository.

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.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.560 Geometry
P Styles > P.540 Planar
P Styles > P.999 Others
Z Theory > Z.500 Representations
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 04 May 2016 16:10
Last Modified: 04 May 2016 16:10
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1491

Actions (login required)

View Item View Item