On the Optimal Layout of Planar Graphs with Fixed Boundary
From MaRDI portal
Publication:3027032
DOI10.1137/0216061zbMath0625.05020OpenAlexW2145290099MaRDI QIDQ3027032
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216061
Monte Carlo methods (65C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items
Self-organizing maps for drawing large graphs ⋮ Layouts with wires of balanced length ⋮ Tutte's barycenter method applied to isotopies ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ \(H^1\)-parametrizations of complex planar physical domains in isogeometric analysis ⋮ An algorithm for drawing general undirected graphs ⋮ Spring algorithms and symmetry ⋮ Discrete one-forms on meshes and applications to 3D mesh parameterization ⋮ Graph multidimensional scaling with self-organizing maps
This page was built for publication: On the Optimal Layout of Planar Graphs with Fixed Boundary