Edge-Weighted Contact Representations of Planar Graphs

DOI10.1007/978-3-642-36763-2_20zbMath1377.68184OpenAlexW2115023660MaRDI QIDQ4912204

Roman Prutkin, Ignaz Rutter, Martin Nöllenburg

Publication date: 3 April 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36763-2_20

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Signed and weighted graphs (05C22)

Related Items (1)

Computing cartograms with optimal complexity

This page was built for publication: Edge-Weighted Contact Representations of Planar Graphs