Computing k-modal embeddings of planar digraphs

DOI10.4230/LIPIcs.ESA.2019.19OpenAlexW2977612813MaRDI QIDQ5075755

Juan Jose Besa, Giordano Da Lozzo, Michael T. Goodrich

Publication date: 11 May 2022

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

zbMATH Keywords

planaritydirected graphsmodal embeddingsSPQR treesNAESAT

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Planar L-Drawings of Bimodal Graphs, A user study on hybrid graph visualizations, Unnamed Item, Simultaneous FPQ-ordering and hybrid planarity testing, Beyond Clustered Planar Graphs, Planar L-Drawings of Bimodal Graphs

Uses Software

• NodeTrix

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum upward planar subgraphs of embedded planar digraphs
• Upward drawings of triconnected digraphs.
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Turning cliques into paths to achieve planarity
• NodeTrix planarity testing with small clusters
• Upward and quasi-upward planarity testing of embedded mixed graphs
• The importance of being proper
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Computing NodeTrix Representations of Clustered Graphs
• Beyond Level Planarity
• Algorithms and Bounds for L-Drawings of Directed Graphs
• Radial Level Planarity Testing and Embedding in Linear Time
• Hierarchies and planarity theory
• Efficient Planarity Testing
• Partial and Constrained Level Planarity
• Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
• Planar L-Drawings of Directed Graphs
• Windrose Planarity
• Theory and Applications of Satisfiability Testing
• Intersection-Link Representations of Graphs