Recognizing a DOG is Hard but not when it is Thin and Unit

DOI10.4230/LIPIcs.FUN.2016.16zbMath1369.68269OpenAlexW2488304761MaRDI QIDQ5282814

Mereke Van Garderen, Valentin Polishchuk, Maarten Löffler, William S. Evans

Publication date: 17 July 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.FUN.2016.16

zbMATH Keywords

planar graphsgraph drawingdisk intersection graphs

Mathematics Subject Classification ID

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 representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

On Embeddability of Unit Disk Graphs onto Straight Lines ⋮ On embeddability of unit disk graphs onto straight lines ⋮ Unnamed Item

This page was built for publication: Recognizing a DOG is Hard but not when it is Thin and Unit