Logarithmic Weisfeiler--Leman and Treewidth
From MaRDI portal
Publication:6429555
arXiv2303.07985MaRDI QIDQ6429555
Nicholas Sieger, Michael Levet, Puck Rombach
Publication date: 14 March 2023
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Descriptive complexity and finite models (68Q19)
This page was built for publication: Logarithmic Weisfeiler--Leman and Treewidth