Turning cliques into paths to achieve planarity
From MaRDI portal
Publication:1725735
DOI10.1007/978-3-030-04414-5_5OpenAlexW2888177111MaRDI QIDQ1725735
Peter Eades, Seok-Hee Hong, Alessandra Tappini, Patrizio Angelini, Giuseppe Liotta, Karsten Klein, Alfredo Navarra, Stephen G. Kobourov
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.08925
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Turning cliques into paths to achieve planarity ⋮ Computing k-modal embeddings of planar digraphs ⋮ Beyond Clustered Planar Graphs
Cites Work
- Graphs drawn with few crossings per edge
- Turning cliques into paths to achieve planarity
- NodeTrix planarity testing with small clusters
- An annotated bibliography on 1-planarity
- Computing NodeTrix Representations of Clustered Graphs
- Minimum-weight triangulation is NP-hard
- On Optimal 2- and 3-Planar Graphs
- Revisited Experimental Comparison of Node-Link and Matrix Representations
- Intersection-Link Representations of Graphs
