Graph Drawing

DOI10.1007/b105810zbMath1111.68583OpenAlexW4206160220WikidataQ56267165 ScholiaQ56267165MaRDI QIDQ5711614

Stefan Hachul, Michael Jünger

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105810

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (28)

Complex systems: features, similarity and connectivity ⋮ FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing ⋮ Shape-faithful graph drawings ⋮ A Distributed Multilevel Force-Directed Algorithm ⋮ A Sparse Stress Model ⋮ Placing Arrows in Directed Graph Drawings ⋮ Visualizing evolving trees ⋮ Fast layout computation of clustered networks: algorithmic advances and experimental analysis ⋮ A quality metric for visualization of clusters in graphs ⋮ Multi-level graph drawing using infomap clustering ⋮ Node overlap removal algorithms: a comparative study ⋮ Emanation graph: a plane geometric spanner with Steiner points ⋮ An Experimental Study on the Ply Number of Straight-Line Drawings ⋮ An Experimental Study on the Ply Number of Straight-line Drawings ⋮ A force-directed algorithm for drawing directed graphs symmetrically ⋮ An Interactive Tool to Explore and Improve the Ply Number of Drawings ⋮ Drawing Big Graphs Using Spectral Sparsification ⋮ Drawing Dynamic Graphs Without Timeslices ⋮ Aesthetic discrimination of graph layouts ⋮ Node Overlap Removal Algorithms: an Extended Comparative Study ⋮ Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points ⋮ Faster force-directed graph drawing with the well-separated pair decomposition ⋮ Rapid Multipole Graph Drawing on the GPU ⋮ The Binary Stress Model for Graph Drawing ⋮ Generalizing Geometric Graphs ⋮ Aesthetic Discrimination of Graph Layouts ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ An effective crossing minimisation heuristic based on star insertion

This page was built for publication: Graph Drawing