Placing Arrows in Directed Graph Drawings

DOI10.1007/978-3-319-50106-2_4zbMath1478.68218arXiv1608.08505OpenAlexW2507498686MaRDI QIDQ2961503

Walter Didimo, Giuseppe Liotta, Carla Binucci, Fabrizio Montecchiani, Markus Chimani

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) 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)

Related Items

Algorithms and Bounds for L-Drawings of Directed Graphs, Placing Arrows in Directed Graph Drawings

Uses Software

• OGDF

Cites Work

• Point labeling with sliding labels
• Trajectory-Based Dynamic Map Labeling
• Placing Arrows in Directed Graph Drawings
• Planar Formulae and Their Uses
• LABELING POINTS WITH CIRCLES
• Graph Drawing
• On the complexity of the Edge Label Placement problem
• Three rules suffice for good label placement
• Unnamed Item