CAGIRICI, Onur, Petr HLINĚNÝ, Filip POKRÝVKA and Abhisekh SANKARAN. Clique-Width of Point Configurations. Journal of Combinatorial Theory, Ser B. Amsterdam: Elsevier B.V., 2023, vol. 158, No 1, p. 43-73. ISSN 0095-8956. Available from: https://dx.doi.org/10.1016/j.jctb.2021.09.001.
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 Journal of Combinatorial Theory, Ser B, Amsterdam, Elsevier B.V. 2023, 0095-8956.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Netherlands
Confidentiality degree is not subject to a state or trade secret
WWW DOI open access preprint
Impact factor Impact factor: 1.400 in 2022
RIV identification code RIV/00216224:14330/23:00129924
Organization unit Faculty of Informatics
Doi http://dx.doi.org/10.1016/j.jctb.2021.09.001
UT WoS 000901805500003
Keywords in English point configuration; order type; fixed-parameter tractability; relational structure; clique-width
Tags formela-journal
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 7/4/2024 22:27.
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 show that it is aligned with the general concept of clique-width of relational structures by Blumensath and Courcelle (2006). We also relate the new notion to 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/1081/2022, interní kód MUName: Modelování, analýza a verifikace (2023)
Investor: Masaryk University
MUNI/A/1145/2021, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace XI. (Acronym: SV-FI MAV XI.)
Investor: Masaryk University
PrintDisplayed: 28/4/2024 14:46