Work

Intersection-Link Representations of Graphs

Year: 2017

Type: article

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 ${\rm C{\small LIQUE} P{\small LANARITY}}$, for intersection-link representations of graphs in which the dense subgraphs are cliques.

Source: Journal of Graph Algorithms and Applications

DOI: 10.7155/jgaa.00437

Authors: Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter

Institutions: University of Tübingen, University of California, Irvine, Roma Tre University, Eindhoven University of Technology

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond