scientific article; zbMATH DE number 7779760

DOI10.57717/cgt.v2i1.43MaRDI QIDQ6179343

Giordano Da Lozzo, Markus Chimani, Alexander Wolff, Maurizio Patrignani, Sabine Cornelsen, Steven Chaplick, Ioannis. G. Tollis, Martin Nöllenburg

Publication date: 16 December 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completenessdirected graphsplanar L-drawingsbitonic st-ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Algorithms for plane representations of acyclic digraphs
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• On Balanced -Contact Representations
• Bitonic st-orderings of Biconnected Planar Graphs
• On the Complexity of HV-rectilinear Planarity Testing
• Bitonic st-orderings for Upward Planar Graphs
• Overloaded Orthogonal Drawings
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On Triangle Contact Graphs
• Computing k-modal embeddings of planar digraphs
• Planar confluent orthogonal drawings of 4-modal digraphs

This page was built for publication: