The 2-dimensional Weisfeiler-Leman algorithm detects 2-separators and implicitly computes 3-connected decompositions, yielding a WL dimension upper bound of k for treewidth-k graphs and a factor-2-tight lower bound.
Faster canonical forms for strongly regular graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
The 2-dimensional Weisfeiler-Leman algorithm detects 2-separators and implicitly computes 3-connected decompositions, yielding a WL dimension upper bound of k for treewidth-k graphs and a factor-2-tight lower bound.