scientific article; zbMATH DE number 7561610
From MaRDI portal
Publication:5091279
DOI10.4230/LIPIcs.ICALP.2019.117MaRDI QIDQ5091279
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.07216
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
The Weisfeiler-Leman dimension of distance-hereditary graphs ⋮ The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw ⋮ Canonisation and Definability for Graphs of Bounded Rank Width ⋮ The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exploiting symmetries for scaling loopy belief propagation and relational training
- An optimal lower bound on the number of variables for graph identification
- Sherali-Adams relaxations of graph isomorphism polytopes
- Graph isomorphism, color refinement, and compactness
- Practical graph isomorphism. II.
- Sherali--Adams Relaxations and Indistinguishability in Counting Logics
- Graphs Identified by Logics with Counting
- On Tinhofer’s Linear Programming Approach to Isomorphism Testing
- Interval Graphs: Canonical Representations in Logspace
- Isomorphism testing for embeddable graphs through definability
- Limitations of Algebraic Approaches to Graph Isomorphism Testing
- PEBBLE GAMES AND LINEAR EQUATIONS
- Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic
- Lov\'asz Meets Weisfeiler and Leman
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem
- Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
- On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Graph isomorphism in quasipolynomial time [extended abstract]
- Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs
- Fixed-point definability and polynomial time on graphs with excluded minors
This page was built for publication:
