Recognizing Weighted Disk Contact Graphs
From MaRDI portal
Publication:2959776
DOI10.1007/978-3-319-27261-0_36zbMath1471.68199arXiv1509.00720OpenAlexW1785626425MaRDI QIDQ2959776
Roman Prutkin, Boris Klemz, Martin Nöllenburg
Publication date: 10 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.00720
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Unit disk representations of embedded trees, outerplanar and multi-legged graphs ⋮ Finding geometric representations of apex graphs is NP-hard ⋮ Computing stable Demers cartograms ⋮ Placing your Coins on a Shelf
