2019
On conflict-free chromatic guarding of simple polygons
CAGIRICI, Onur, Subir GHOSH, Petr HLINĚNÝ and Bodhayan ROYBasic information
Original name
On conflict-free chromatic guarding of simple polygons
Authors
CAGIRICI, Onur (792 Turkey, belonging to the institution), Subir GHOSH (356 India), Petr HLINĚNÝ ORCID (203 Czech Republic, guarantor, belonging to the institution) and Bodhayan ROY (356 India)
Edition
Cham, 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA'19), p. 601-612, 12 pp. 2019
Publisher
Springer, Lecture Notes in Computer Science, volume 11949
Other information
Language
English
Type of outcome
Proceedings paper
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Germany
Confidentiality degree
is not subject to a state or trade secret
Publication form
electronic version available online
References:
Impact factor
Impact factor: 0.402 in 2005
RIV identification code
RIV/00216224:14330/19:00107778
Organization unit
Faculty of Informatics
ISBN
978-3-030-36411-3
ISSN
Keywords in English
polygon visibility graph; graph coloring; polygon guarding
Tags
Tags
International impact, Reviewed
Changed: 14/4/2021 21:33, prof. RNDr. Petr Hliněný, Ph.D.
Abstract
V originále
We study the problem of colouring the vertices of a polygon, such that every viewer can see a unique colour. The goal is to minimize the number of colours used. This is also known as the conflict-free chromatic guarding problem with vertex guards, and is motivated, e.g., by the problem of radio frequency assignment to sensors placed at the polygon vertices.
Links
| GA17-00837S, research and development project |
| ||
| MUNI/A/1018/2018, interní kód MU |
| ||
| MUNI/A/1040/2018, interní kód MU |
|