Simultaneous FPQ-ordering and hybrid planarity testing

DOI10.1016/j.tcs.2021.05.012zbMath1504.68177arXiv1910.10113OpenAlexW4212823911MaRDI QIDQ2034412

Giuseppe Liotta, Alessandra Tappini, Ignaz Rutter

Publication date: 22 June 2021

Published in: Theoretical Computer Science, SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

graph drawinghybrid planarity testingsimultaneous FPQ-ordering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

A user study on hybrid graph visualizations ⋮ \((k,p)\)-planarity: a relaxation of hybrid planarity ⋮ Synchronized Planarity with Applications to Constrained Planarity Problems ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Beyond Clustered Planar Graphs

Uses Software

• NodeTrix

Cites Work

• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Beyond level planarity: cyclic, torus, and simultaneous level planarity
• NodeTrix planarity testing with small clusters
• Computing NodeTrix Representations of Clustered Graphs
• Planar Graphs with Topological Constraints
• On-Line Planarity Testing
• Testing Planarity of Partially Embedded Graphs
• Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
• Computing k-modal embeddings of planar digraphs
• (k, p)-Planarity: A Relaxation of Hybrid Planarity
• Planarity Testing and Optimal Edge Insertion with Embedding Constraints
• Intersection-Link Representations of Graphs

This page was built for publication: Simultaneous FPQ-ordering and hybrid planarity testing