Canonisation and Definability for Graphs of Bounded Rank Width

01/29/2019
by   Martin Grohe, et al.
0

We prove that the combinatorial Weisfeiler-Leman algorithm of dimension (3k+4) is a complete isomorphism test for the class of all graphs of rank width at most k. Rank width is a graph invariant that, similarly to tree width, measures the width of a certain style of hierarchical decomposition of graphs; it is equivalent to clique width. It was known that isomorphism of graphs of rank width k is decidable in polynomial time (Grohe and Schweitzer, FOCS 2015), but the best previously known algorithm has a running time n^f(k) for a non-elementary function f. Our result yields an isomorphism test for graphs of rank width k running in time n^O(k). Another consequence of our result is the first polynomial time canonisation algorithm for graphs of bounded rank width. Our second main result is that fixed-point logic with counting captures polynomial time on all graph classes of bounded rank width.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/10/2020

Colouring (sP_1+P_5)-Free Graphs: a Mim-Width Perspective

We prove that the class of (K_t,sP_1+P_5)-free graphs has bounded mim-wi...
research
06/30/2023

Logarithmic Weisfeiler–Leman Identifies All Graphs of Bounded Rank Width

In this paper, we extend the work of Grohe Neuen (ACM T. Comput. Log...
research
12/27/2022

FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank

We propose an algorithm whose input are parameters k and r and a hypergr...
research
12/28/2022

Hypergraphs with Polynomial Representation: Introducing r-splits

Inspired by the split decomposition of graphs and rank-width, we introdu...
research
03/20/2023

Bounded twin-width graphs are polynomially χ-bounded

We show that every graph with twin-width t has chromatic number O(ω ^k_t...
research
03/19/2018

An improved isomorphism test for bounded-tree-width graphs

We give a new fpt algorithm testing isomorphism of n-vertex graphs of tr...
research
12/23/2017

The tractability frontier of well-designed SPARQL queries

We study the complexity of query evaluation of SPARQL queries. We focus ...

Please sign up or login with your details

Forgot password? Click here to reset