(k, p)-Planarity: A Relaxation of Hybrid Planarity

DOI10.1007/978-3-030-10564-8_12OpenAlexW2891998810MaRDI QIDQ5236164

Giuseppe Liotta, Alessandra Tappini, Timothy W. Randolph, Emilio Di Giacomo, William J. Lenhart

Publication date: 15 October 2019

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.11413

zbMATH Keywords

\((kclustered graphshybrid representationsp)\)-planarity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

A user study on hybrid graph visualizations ⋮ ChordLink: a new hybrid visualization model ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Simultaneous FPQ-ordering and hybrid planarity testing

This page was built for publication: (k, p)-Planarity: A Relaxation of Hybrid Planarity