An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing

@inproceedings{Eiglsperger2004AnEI,
  title={An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing},
  author={Markus Eiglsperger and Martin Siebenhaller and Michael Kaufmann},
  booktitle={Graph Drawing},
  year={2004}
}
Sugiyama's algorithmic framework for layered graph drawing is commonly used in practical software. The extensive use of dummy vertices to break long edges between non-adjacent layers often leads to unsatisfactorial performance. The worst-case running-time of Sugiyama's approach is O(|V||E|log|E|) requiring O(|V||E|) memory, which makes it unusable for the visualization of large graphs. By a conceptually simple new technique we are able to keep the number of dummy vertices and edges linear in… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

Notes on an implementation of Sugiyama’s scheme

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Visual Analysis of Large Graphs Using (X,Y)-Clustering and Hybrid Visualizations

  • IEEE Transactions on Visualization and Computer Graphics
  • 2010
VIEW 1 EXCERPT
CITES METHODS