Orthogonal drawings of graphs with vertex and edge labels

DOI10.1016/j.comgeo.2005.02.001zbMath1077.05504OpenAlexW2020838962WikidataQ62042608 ScholiaQ62042608MaRDI QIDQ2573336

Walter Didimo, Maddalena Nonato, Giuseppe Liotta, Carla Binucci

Publication date: 7 November 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.02.001

zbMATH Keywords

Graph drawingLabelingCompaction algorithmsExperimental analysisOrthogonal representations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Algorithms for approximation of functions (65D15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Boundary labeling: Models and efficient algorithms for rectangular maps ⋮ Modifying orthogonal drawings for label placement

Uses Software

• AMPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Turn-regularity and optimal area drawings of orthogonal representations
• An experimental comparison of four graph drawing algorithms.
• Crossing Number is NP-Complete
• Improved algorithm for mixed-integer quadratic programs and a computational study
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
• Drawing database schemas
• A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
• On the complexity of the Edge Label Placement problem
• On the complexity of orthogonal compaction
• Drawing graphs. Methods and models