Citations
Altmetric:
Abstract
In this paper we consider graphs whose edges are associated with a degree of importance, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance. In our approach, more important edges must have fewer crossings. We formalize this problem and provide a polynomial-time testing algorithm for the case in which there exist three different degrees of importance. We also discuss interesting relationships with other constrained-planarity problems.
Description
Date
2019
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Keywords
Edge crossings, Graph partial planarity, SPQR-trees
Citation
Angelini, Patrizio, and Michael A. Bekos. “Hierarchical Partial Planarity.” Algorithmica 81 (6): 2196–221. 2019.