The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
type: Item
instance of: scholarly article
author: Sandra Kiefer
author: Daniel Neuen
publication date: 2022-07-21T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7561689
zbMATH Keywords: Weisfeiler-Leman
zbMATH Keywords: separators
zbMATH Keywords: first-order logic
zbMATH Keywords: counting quantifiers
MaRDI profile type: MaRDI publication profile
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: On Weisfeiler-Leman invariance: subgraph counts and related graph properties
cites work: Sherali-Adams relaxations and indistinguishability in counting logics
cites work: Graph isomorphism in quasipolynomial time [extended abstract]
cites work: Q3127430
cites work: The vertex-connectivity of a distance-regular graph
cites work: The connectivity of strongly regular graphs
cites work: An optimal lower bound on the number of variables for graph identification
cites work: The Power of Counting Logics on Restricted Classes of Finite Structures
cites work: Lov\'asz Meets Weisfeiler and Leman
cites work: On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
cites work: Fixed-point definability and polynomial time on graphs with excluded minors
cites work: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
cites work: PEBBLE GAMES AND LINEAR EQUATIONS
cites work: Logical hierarchies in PTIME
cites work: \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
cites work: Isomorphism of Planar Graphs (Working Paper)
cites work: A V log V algorithm for isomorphism of triconnected planar graphs
cites work: Dividing a Graph into Triconnected Components
cites work: Q4148000
cites work: Q5144654
cites work: On the connectivity of graphs in association schemes
cites work: Q3671211
cites work: Practical graph isomorphism. II.
cites work: Graph Isomorphism for unit square graphs
cites work: Q3216652
full work available at URL: LIPIcs.MFCS.2019.45
OpenAlex ID: W2970802938
title: The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
DOI: 10.4230/LIPICS.MFCS.2019.45
description: scientific article; zbMATH DE number 7561689