Planar L-Drawings of Bimodal Graphs

DOI10.7155/jgaa.00596zbMath1499.68244OpenAlexW3057550977MaRDI QIDQ5050000

Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo

Publication date: 14 November 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00596

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Planar Confluent Orthogonal Drawings of 4-Modal Digraphs ⋮ Planar confluent orthogonal drawings of 4-modal digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• On triangle cover contact graphs
• Upward and quasi-upward planarity testing of embedded mixed graphs
• Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
• Algorithms and Bounds for L-Drawings of Directed Graphs
• A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
• Rectangular duals of planar graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Planar L-Drawings of Directed Graphs
• Windrose Planarity
• Computing k-modal embeddings of planar digraphs
• How to Draw a Graph
• The (3,1)-ordering for 4-connected planar triangulations
• Two algorithms for finding rectangular duals of planar graphs

This page was built for publication: Planar L-Drawings of Bimodal Graphs