Clique-Width of Point Configurations

04/05/2020
by   Onur Çağırıcı, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2019

On the Clique-Width of Unigraphs

Clique-width is a well-studied graph parameter. For graphs of bounded cl...
research
03/10/2020

Maximizing Happiness in Graphs of Bounded Clique-Width

Clique-width is one of the most important parameters that describes stru...
research
08/17/2020

A unified algorithm for colouring graphs of bounded clique-width

Clique-width is one of the graph complexity measures leading to polynomi...
research
07/12/2017

Fast exact algorithms for some connectivity problems parametrized by clique-width

Given a clique-width expression of a graph G of clique-width k, we provi...
research
09/13/2023

A fixed-parameter tractable algorithm for combinatorial filter reduction

What is the minimal information that a robot must retain to achieve its ...
research
07/10/2023

Tight Algorithmic Applications of Clique-Width Generalizations

In this work, we study two natural generalizations of clique-width intro...
research
11/05/2020

MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width

Seese's conjecture for finite graphs states that monadic second-order lo...

Please sign up or login with your details

Forgot password? Click here to reset