Isomorphism testing for graphs of bounded rank width

DOI10.1109/FOCS.2015.66MaRDI QIDQ6946844zbMATH OpenFDO

Authors P. Schweitzer, Martin Grohe

Publication date 5 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2015.66

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(5)

• Hypergraph isomorphism for groups with restricted composition factors
• Canonizing graphs of bounded rank-width in parallel via Weisfeiler-Leman
• Isomorphism testing for graphs excluding small topological subgraphs
• The isomorphism problem of power graphs and a question of Cameron
• Bridging treewidth and clique-width via cograph-modular-treewidth

This page was built for publication: Isomorphism testing for graphs of bounded rank width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946844)