Drawing Graphs with GLEE
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2084264 (Why is no real title available?)
- scientific article; zbMATH DE number 1974111 (Why is no real title available?)
- scientific article; zbMATH DE number 1974114 (Why is no real title available?)
- Drawing Graphs with GLEE
- Graph Drawing
- Graph drawing. 10th international symposium, GD 2002, Irvine, CA, USA, August 26--28, 2002. Revised papers
- Graph layering by promotion of nodes
- In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes
- Optimal scheduling for two-processor systems
- Short and smooth polygonal paths
Cited in
(7)- Edge routing with ordered bundles
- Edge routing with ordered bundles
- Drawing Graphs with GLEE
- Compact layered drawings of general directed graphs
- A flow formulation for horizontal coordinate assignment with prescribed width
- A generalization of the directed graph layering problem
- scientific article; zbMATH DE number 2084316 (Why is no real title available?)
This page was built for publication: Drawing Graphs with GLEE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452241)