A logic-based algorithmic meta-theorem for mim-width
We introduce a logic called distance neighborhood logic with acyclicity and connectivity
constraints (A&C DN for short) which extends existential MSO1 with predicates for querying …
constraints (A&C DN for short) which extends existential MSO1 with predicates for querying …
Tight algorithmic applications of clique-width generalizations
V Chekan, S Kratsch - arXiv preprint arXiv:2307.04628, 2023 - arxiv.org
In this work, we study two natural generalizations of clique-width introduced by Martin F\"
urer. Multi-clique-width (mcw) allows every vertex to hold multiple labels [ITCS 2017], while …
urer. Multi-clique-width (mcw) allows every vertex to hold multiple labels [ITCS 2017], while …
A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width
N Bojikian, S Kratsch - arXiv preprint arXiv:2307.14264, 2023 - arxiv.org
Recently, Hegerfeld and Kratsch [ESA 2023] obtained the first tight algorithmic results for
hard connectivity problems parameterized by clique-width. Concretely, they gave one-sided …
hard connectivity problems parameterized by clique-width. Concretely, they gave one-sided …
Computing Width Parameters of Graphs
T Korhonen - 2024 - bora.uib.no
The treewidth of a graph describes its tree-likeness by how well it can be decomposed by
small separators. It is defined as the minimum width of a tree decomposition of the graph …
small separators. It is defined as the minimum width of a tree decomposition of the graph …
Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
F Hegerfeld - 2023 - edoc.hu-berlin.de
Die Kernaufgabe der parameterisierten Komplexität ist zu verstehen, wie Eingabestruktur
die Problemkomplexität beeinflusst. Wir untersuchen diese Fragestellung aus einer …
die Problemkomplexität beeinflusst. Wir untersuchen diese Fragestellung aus einer …