The graph isomorphism problem Page 1 128 COMMUNICATIONS OF THE ACM |
NOVEMBER 2020 | VOL. 63 | NO. 11 review articles IMA GE B Y NAD A V/SHUTTERS T …

Descriptive complexity theory establishes a connection between the computational
complexity of algorithmic problems (the computational resources required to solve the …

A vertex colouring of a graph $ G $ is" nonrepetitive" if $ G $ contains no path for which the
first half of the path is assigned the same sequence of colours as the second half. Thue's …

This paper gives an introduction to the new research area of Organic Computing and shows
chances, opportunities and problems currently tackled by researchers. First the visions that …

We say a class C of graphs is clean if for every positive integer t there exists a positive
integer w (t) such that every graph in C with treewidth more than w (t) contains an induced …

Abstract The Weisfeiler-Leman (WL) algorithm is a fundamental combinatorial technique
used to classify graphs and other relational structures. It dates back to the 1960s and has …

We introduce a new technique for designing fixed-parameter algorithms for cut problems,
called randomized contractions. We apply our framework to obtain the first fixed-parameter …

We study two notions of being well-structured for classes of graphs that are inspired by
classic model theory. A class of graphs is monadically stable if it is impossible to define …

We present a linear-time algorithm to compute a decomposition scheme for graphs G that
have a set X⊆ V (G), called a treewidth-modulator, such that the treewidth of G− X is …

A colouring of a graph is" nonrepetitive" if for every path of even order, the sequence of
colours on the first half of the path is different from the sequence of colours on the second …