Clique-Width of Point Configurations

• Autoři: CAGIRICI Onur; HLINĚNÝ Petr; POKRÝVKA Filip; SANKARAN Abhisekh
• Rok publikování: 2020
• Druh: Článek ve sborníku
• Konference: Graph-Theoretic Concepts in Computer Science, WG 2020
• Fakulta / Pracoviště MU: Fakulta informatiky

www

• http://dx.doi.org/10.1007/978-3-030-60440-0_5
• open access preprint

• Doi: http://dx.doi.org/10.1007/978-3-030-60440-0_5
• Klíčová slova: point configuration; order type; fixed-parameter tractability; relational structure; clique-width
• Popis: 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.

Související projekty

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