Drawing Graphs with GLEE
From MaRDI portal
Publication:5452241
DOI10.1007/978-3-540-77537-9_38zbMath1137.68500WikidataQ56226610 ScholiaQ56226610MaRDI QIDQ5452241
Lev Nachmanson, Bongshin Lee, George Robertson
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
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
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