Twin-width VIII: delineation and win-wins

  title={Twin-width VIII: delineation and win-wins},
  author={{\'E}douard Bonnet and Dibyayan Chakraborty and Eun Jung Kim and Noleen K{\"o}hler and Raul Lopes and St{\'e}phan Thomass{\'e}},
  booktitle={International Symposium on Parameterized and Exact Computation},
We introduce the notion of delineation. A graph class C is said delineated by twin-width (or simply, delineated ) if for every hereditary closure D of a subclass of C , it holds that D has bounded twin-width if and only if D is monadically dependent. An effective strengthening of delineation for a class C implies that tractable FO model checking on C is perfectly understood: On hereditary closures D of subclasses of C , FO model checking is fixed-parameter tractable (FPT) exactly when D has… 

Twin-width VI: the lens of contraction sequences

This paper defines an oriented version of twin-width, where appearing red edges are oriented away from the newly contracted vertex, and the mere red out-degree should remain bounded, and explores the concept of partial contraction sequences, where, instead of terminating on a single-vertex graph, the sequence ends when reaching a particular target class.

Twin-width and Transductions of Proper k-Mixed-Thin Graphs

, Abstract. The new graph parameter twin-width, introduced by Bonnet, Kim, Thomass´e and Watrigant in 2020, allows for an FPT algorithm for testing all FO properties of graphs. This makes classes of

First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs

. We characterise the classes of tournaments with tractable first-order model checking. For every hereditary class of tournaments T , first-order model checking either is fixed parameter tractable, or

Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs

The complexity of the problem of deciding properties expressible in FO logic on graphs – the FO model checking problem (parameterized by the respective FO formula), is well-understood on so-called

Twin-width VII: groups

. Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by

Component twin-width as a parameter for BINARY-CSP and its semiring generalisations

An algebraic approach relying on semirings that unifies different generalizations of BINARY-CSPs (such as the counting, the list, and the weighted versions) is explored, and shows that it improves the best complexity upper bounds in the literature for several well-known problems.

Neighbourhood complexity of graphs of bounded twin-width

We give essentially tight bounds for, ν ( d, k ), the maximum number of distinct neighbourhoods on a set X of k vertices in a graph with twin-width at most d . Using the celebrated Marcus-Tardos

Computation of twin-width of graphs

: Twin-width is a recently introduced graph parameter. In this arti-cle, we compute twin-width of various finite graphs. In particular, we prove that the twin-widths of finite graphs with 4 and 5

Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation

Fixed-parameter tractability of the Directed Multicut problem with three terminal pairs is shown and an irrelevant vertex rule is shown, if any of the matrices in the said encoding has a large grid minor, which can be proclaimed irrelevant — not contained in the sought solution — and thus reduced.

Twin-width can be exponential in treewidth

This work builds a graph with a vertex deletion set of size t to a tree, and twin-width greater than 2 (1 − ε ) t, and shows that the twin- width is sometimes exponential in the treewidth, in the so-called oriented twin-Width and grid number.



Twin-width III: Max Independent Set, Min Dominating Set, and Coloring

This paper presents 2 O ( k ) n -time algorithms for k -Independent Set, r -Scattered Set, k -Clique, and k -Dominating Set when an O (1)-sequence of the graph is given in input, and shows how breadth-first search can be mimicked, when replacing “traversing an edge” by “Traversing a biclique all at once”.

Twin-width I: tractable FO model checking

It is proved that bounded twin-width is preserved by FO interpretations and transductions (allowing operations such as squaring or complementing a graph) and unifies and significantly extends the knowledge on fixed-parameter tractability of FO model checking on non-monotone classes, such as the FPT algorithm on bounded-width posets.

Deciding first-order properties of nowhere dense graphs

It is shown that deciding properties of graphs definable in first-order logic is fixed-parameter tractable on nowhere dense graph classes, and a "rank-preserving" version of Gaifman's locality theorem is proved.

Deciding twin-width at most 4 is NP-complete

It is shown that determining if an n-vertex graph has twin-width at most 4 is NP-complete, and requires time 2Ω(n/ log n) unless the Exponential-Time Hypothesis fails, and how to encode trigraphs H into graphs G, in the sense that every d-sequence inevitably creates H as an induced subtrigraph.

FO model checking of geometric graphs

This work studies the FO model checking problem for dense graph classes definable by geometric means (intersection and visibility graphs) and obtains new nontrivial FPT results, e.g., for restricted subclasses of circular-arc, circle, box, disk, and polygon-visibility graphs.

Twin-width II: small classes

The twin-width of a graph is shown to be the minimum integer d such that it has a sequence of iterated vertex identifications for which the overall maximum number of red edges incident to a single vertex is at most $d, and the "small conjecture" that every small hereditary class has bounded twin- width is explored.

Twin-width and permutations

It is proved that a class of binary relational structures (that is: edge-colored partially directed graphs) has bounded twin-width if and only if it is a first-order transduction of a proper permutation class.

Parameterized Complexity of First-Order Logic

It is shown that if C is a class of graphs which is nowhere dense then rst-order model-checking is xed-parameter tractable on C, which essentially gives a precise characterisation of classes for which FO model- checking is tractable.

Clique-Width is NP-Complete

It is shown that the clique-width of a given graph cannot be absolutely approximated in polynomial time unless P = NP, and that, given a graph $G$ and an integer $k$, deciding whether the cliques- width of G is at most $k$ is NP-complete.

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

It is proved that this is also the case for graphs of clique-width at most k, where this complexity measure is associated with hierarchical decompositions of another type, and where logical formulas are no longer allowed to use edge set quantifications.