Drawing Graphs with GLEE

DOI10.1007/978-3-540-77537-9_38zbMath1137.68500OpenAlexW2159486712WikidataQ56226610 ScholiaQ56226610MaRDI QIDQ5452241

George Robertson, Lev Nachmanson, Bongshin Lee

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_38

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Edge routing with ordered bundles ⋮ Edge Routing with Ordered Bundles ⋮ A Generalization of the Directed Graph Layering Problem ⋮ Compact Layered Drawings of General Directed Graphs ⋮ Drawing Graphs with GLEE ⋮ A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph drawing. 10th international symposium, GD 2002, Irvine, CA, USA, August 26--28, 2002. Revised papers
• Graph layering by promotion of nodes
• Optimal scheduling for two-processor systems
• In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes
• Drawing Graphs with GLEE
• Graph Drawing
• Short and smooth polygonal paths

This page was built for publication: Drawing Graphs with GLEE