NodeTrix planarity testing with small clusters
From MaRDI portal
Publication:2319629
DOI10.1007/s00453-019-00585-6zbMath1429.68187arXiv1708.09281OpenAlexW2753590971MaRDI QIDQ2319629
Emilio Di Giacomo, Ignaz Rutter, Maurizio Patrignani, Alessandra Tappini, Giuseppe Liotta
Publication date: 20 August 2019
Published in: Algorithmica, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.09281
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (11)
A user study on hybrid graph visualizations ⋮ \((k,p)\)-planarity: a relaxation of hybrid planarity ⋮ ChordLink: a new hybrid visualization model ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Clustered planarity = flat clustered planarity ⋮ Turning cliques into paths to achieve planarity ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Simultaneous FPQ-ordering and hybrid planarity testing ⋮ Computing k-modal embeddings of planar digraphs ⋮ NodeTrix planarity testing with small clusters ⋮ Beyond Clustered Planar Graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- NodeTrix planarity testing with small clusters
- Disconnectivity and relative positions in simultaneous embeddings
- Book embeddability of series-parallel digraphs
- Computing NodeTrix Representations of Clustered Graphs
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- The Recognition of Series Parallel Digraphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- On-Line Planarity Testing
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Intersection-Link Representations of Graphs
- The complexity of satisfiability problems
This page was built for publication: NodeTrix planarity testing with small clusters
