CAGIRICI, Onur, Petr HLINĚNÝ, Filip POKRÝVKA and Abhisekh SANKARAN. Clique-Width of Point Configurations. Online. In Graph-Theoretic Concepts in Computer Science, WG 2020. Cham: Springer, Lecture Notes in Computer Science, 2020. p. 54-66. ISBN 978-3-030-60439-4. Available from: https://dx.doi.org/10.1007/978-3-030-60440-0_5. [citováno 2024-04-23]
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Clique-Width of Point Configurations
Authors CAGIRICI, Onur (792 Turkey, belonging to the institution), Petr HLINĚNÝ (203 Czech Republic, guarantor, belonging to the institution), Filip POKRÝVKA (703 Slovakia, belonging to the institution) and Abhisekh SANKARAN (356 India)
Edition Cham, Graph-Theoretic Concepts in Computer Science, WG 2020, p. 54-66, 13 pp. 2020.
Publisher Springer, Lecture Notes in Computer Science
Other information
Original 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 printed version "print"
WWW open access preprint URL
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/20:00114292
Organization unit Faculty of Informatics
ISBN 978-3-030-60439-4
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-030-60440-0_5
Keywords in English point configuration; order type; fixed-parameter tractability; relational structure; clique-width
Tags core_A, firank_A, formela-conference
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 29/4/2021 12:20.
Abstract
While structural width parameters (of the input) belong to the standard toolbox of graph algorithms, it is not the usual case in computational geometry. As a case study we propose a natural extension of the structural graph parameter of clique-width to geometric point configurations represented by their order type. We study basic properties of this clique-width notion, and relate it to the monadic second-order logic of point configurations. As an application, we provide several linear FPT time algorithms for geometric point problems which are NP-hard in general, in the special case that the input point set is of bounded clique-width and the clique-width expression is also given.
Links
GA20-04567S, research and development projectName: Struktura efektivně řešitelných případů těžkých algoritmických problémů na grafech
Investor: Czech Science Foundation
MUNI/A/1050/2019, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace IX (Acronym: SV-FI MAV IX)
Investor: Masaryk University, Category A
MUNI/A/1076/2019, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 20 (Acronym: SKOMU)
Investor: Masaryk University, Category A
PrintDisplayed: 23/4/2024 14:08