Area-efficient static and incremental graph drawings
From MaRDI portal
Publication:826069
Recommendations
Cited in
(24)- Orthogonal drawings based on the stratification of planar graphs
- Bounded degree acyclic decompositions of digraphs.
- Balanced vertex-orderings of graphs
- Optimal-area visibility representations of outer-1-plane graphs
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Streamed Graph Drawing and the File Maintenance Problem
- Relating bends and size in orthogonal graph drawings
- scientific article; zbMATH DE number 2084280 (Why is no real title available?)
- Algorithms and bounds for L-drawings of directed graphs
- Graph compact orthogonal layout algorithm
- Drawing trees in a streaming model
- Bend-optimal orthogonal graph drawing in the general position model
- GRIP: Graph Drawing with Intelligent Placement
- scientific article; zbMATH DE number 1974134 (Why is no real title available?)
- Drawing Clustered Graphs on an Orthogonal Grid
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs
- Square-orthogonal drawing with few bends per edge
- An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
- SOFSEM 2005: Theory and Practice of Computer Science
- On the complexity of some geometric problems with fixed parameters
- The DFS-heuristic for orthogonal graph drawing
- Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
- Non-planar square-orthogonal drawing with few-bend edges
This page was built for publication: Area-efficient static and incremental graph drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826069)
