Flip-width: Cops and Robber on dense graphs

We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width and twin-width for dense graphs. The flip-width parameters are defined using variants of the Cops and Robber game, in which the robber has sp...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings / annual Symposium on Foundations of Computer Science pp. 663 - 700
Main Author: Torunczyk, Szymon
Format: Conference Proceeding
Language:English
Published: IEEE 06.11.2023
Subjects:
Approximation algorithms
Computational modeling
Computer science
first-order logic
Games
Graph theory
model checking
monadic dependence
parameterised complexity
Perturbation methods
Robustness
structural graph theory
transductions
ISSN:2575-8454
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width and twin-width for dense graphs. The flip-width parameters are defined using variants of the Cops and Robber game, in which the robber has speed bounded by a fixed constant r \in \mathbb{N} \cup\{\infty\}, and the cops perform flips (or perturbations) of the considered graph. We then propose a new notion of tameness of a graph class, called bounded flip-width, which is a dense counterpart of classes of bounded expansion of Nešetřil and Ossona de Mendez, and includes classes of bounded twin-width of Bonnet, Kim, Thomassé, and Watrigant. This unifies Sparsity Theory and Twin-width Theory, for the first time providing a common language for studying the central notions of the two theories, such as weak coloring numbers and twin-width - corresponding to winning strategies of one player - or dense shallow minors, rich divisions, or well-linked sets, corresponding to winning strategies of the other player. To demonstrate the robustness of the introduced notions, we prove that boundedness of flip-width is preserved by first-order interpretations, or transductions, generalizing previous results concerning classes of bounded expansion and bounded twin-width. We also show that the considered notions are amenable to algorithms, by providing an algorithm approximating the flip-width of a given graph, which runs in slice-wise polynomial time (XP) in the size of the graph. Finally, we propose a more general notion of tameness, called almost bounded flip-width, which is a dense counterpart of nowhere dense classes. We conjecture, and provide evidence, that classes with almost bounded flip-width coincide with monadically dependent (or monadically NIP) classes, introduced by Shelah in model theory. We also provide evidence that classes of almost bounded flip-width characterise the hereditary graph classes for which the model-checking problem is fixed-parameter tractable, which is of central importance in structural and algorithmic graph theory.
ISSN:2575-8454
DOI:10.1109/FOCS57990.2023.00045