Algorithms and Bounds for L-Drawings of Directed Graphs

DOI10.1142/S0129054118410010zbMath1397.68129OpenAlexW2810914486WikidataQ129643659 ScholiaQ129643659MaRDI QIDQ3177336

Vincenzo Roselli, Valentino Di Donato, Giordano Da Lozzo, Maurizio Patrignani, Marco di Bartolomeo, Patrizio Angelini, Ioannis. G. Tollis

Publication date: 24 July 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118410010

zbMATH Keywords

directed graphsgraph drawingink minimizationorthogonal drawing standard

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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Planar L-Drawings of Bimodal Graphs, Planar Confluent Orthogonal Drawings of 4-Modal Digraphs, Planar confluent orthogonal drawings of 4-modal digraphs, Computing k-modal embeddings of planar digraphs, Planar L-Drawings of Bimodal Graphs

Uses Software

• Gurobi
• yEd
• NodeTrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Drawing trees in a streaming model
• Area-efficient static and incremental graph drawings
• Profile minimization problem for matrices and graphs
• Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• L-Drawings of Directed Graphs
• Placing Arrows in Directed Graph Drawings
• Computing NodeTrix Representations of Clustered Graphs
• Overloaded Orthogonal Drawings
• The total vertex separation number of a graph
• The total vertex separation number and profile of a graph
• DAGView: An Approach for Visualizing Large Graphs
• Reducibility among Combinatorial Problems