Unit Disk Visibility Graphs

• Autoři: AGAOGLU Deniz; CAGIRICI Onur
• Rok publikování: 2021
• Druh: Článek ve sborníku
• Konference: Extended Abstracts EuroComb 2021
• Fakulta / Pracoviště MU: Fakulta informatiky
• Doi: http://dx.doi.org/10.1007/978-3-030-83823-2_61
• Klíčová slova: unit disk graphs; visibility graphs; 3-coloring problem; NP-hardness
• Popis: We study unit disk visibility graphs, where the visibility relation between a pair of geometric entities is defined by not only obstacles, but also the distance between them. This particular graph class models real world scenarios more accurately compared to the conventional visibility graphs. We first define and classify the unit disk visibility graphs, and then show that the 3-coloring problem is NP-complete when unit disk visibility model is used for a set of line segments (which applies to a set of points) and for a polygon with holes.

Související projekty

• Structure of tractable instances of hard algorithmic problems on graphs
• Rozsáhlé výpočetní systémy: modely, aplikace a verifikace X.
• Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 21
• Rozsáhlé výpočetní systémy: modely, aplikace a verifikace XI.