Upward and quasi-upward planarity testing of embedded mixed graphs

DOI10.1016/j.tcs.2014.01.015zbMath1418.68160OpenAlexW2067715601MaRDI QIDQ2437763

Walter Didimo, Carla Binucci, Maurizio Patrignani

Publication date: 13 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.015

zbMATH Keywords

graph drawingmixed graphsupward planarityquasi-upward planarity

Mathematics Subject Classification ID

Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Planar L-Drawings of Bimodal Graphs, Quasi-upward planar drawings with minimum curve complexity, Upward book embeddability of \(st\)-graphs: complexity and algorithms, \(st\)-orientations with few transitive edges, $st$-Orientations with Few Transitive Edges, Coloring mixed and directional interval graphs, Computing k-modal embeddings of planar digraphs, Upward Planarity Testing in Practice, Planar L-Drawings of Bimodal Graphs

Cites Work

• Unnamed Item
• Maximum upward planar subgraphs of embedded planar digraphs
• Upward drawings of triconnected digraphs.
• Quasi-upward planarity
• Empirical evaluation of aesthetics-based graph layout
• Forced orientation of graphs
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Switch-Regular Upward Planarity Testing of Directed Trees
• On the Upward Planarity of Mixed Plane Graphs
• Upward Spirality and Upward Planarity Testing
• Monotone Drawings of Graphs with Fixed Embedding
• Upward Planarity Testing of Embedded Mixed Graphs
• Unilateral Orientation of Mixed Graphs
• Robbins's Theorem for Mixed Multigraphs
• Planar Formulae and Their Uses
• Optimal Upward Planarity Testing of Single-Source Digraphs
• An Approach for Mixed Upward Planarization
• Upward Embeddings and Orientations of Undirected Planar Graphs
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Upward Planarity Testing via SAT
• Upward Planar Drawings and Switch-regularity Heuristics
• Algorithms – ESA 2004
• TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
• Digraphs
• Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods
• Monotone Drawings of Graphs