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 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.
Angelini, P., DA LOZZO, G., DI BATTISTA, G., Frati, F., Patrignani, M., Rutter, I. (2017). Intersection-link representations of graphs. JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS, 21(4), 731-755 [10.7155/jgaa.00437].
Intersection-link representations of graphs
ANGELINI, PATRIZIO;DA LOZZO, GIORDANO;DI BATTISTA, Giuseppe;FRATI, FABRIZIO;PATRIGNANI, Maurizio;
2017-01-01
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 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.| File | Dimensione | Formato | |
|---|---|---|---|
|
Angelini et al-Intersection-Link Representations of Graphs (JGAA 2017).pdf
accesso aperto
Descrizione: Articolo principale
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
937.86 kB
Formato
Adobe PDF
|
937.86 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
