A survey of graph layout problems

By Josep Díaz, Jordi Petit, Maria J. Serna. CSUR, 2002

699 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/20f511ab51666c844abf42547ed11c9a70377217

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Daniel Marx
2. Steven S. Skiena
3. Sheng Di
4. Franck Cappello
5. Louis H. Rowen
6. Zur Izhakian

In Computer Graphics and Computer-Aided Design

1. Jean-Daniel Fekete
2. Peter Lindstrom
3. Steven S. Skiena
4. Bruno Lévy
5. Sheng Di
6. Franck Cappello

In Industrial and Manufacturing Engineering

1. Jean-Daniel Fekete
2. Nathalie Henry Riche
3. Steven S. Skiena

Citations in the corpus

• MatrixExplorer: a Dual-Representation System to Explore Social Networks (2006, background): “These matrices are always readable, even for large and dense graphs, and thus support exploration throughout the analysis process.”
• Design Considerations for Optimizing Storyline Visualizations (2012, background): “These metrics are based on previous research that discusses the legibility and aesthetics of visualizations [8, 35].”
• The Algorithm Design Manual (2020, background): “[DPS02] provide an excellent up-to-date survey on algorithms for bandwidth and related graph layout problems.”
• Parameterized Complexity and Approximation Algorithms (2008, background): “Graph layout problems arise in many application domains such as scheduling, VLSI design and archeology [65].”
• Streaming meshes (2005, background): “In a triangle-compact mesh front span equals vertex span, which in turn is equivalent to graph bandwidth [6], while front width, also known in the finite element literature as wavefront [18], is equivalent to vertex separation [6].”