Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
Michael Levet, Puck Rombach, Nicholas Sieger
In this paper, we show that computing canonical labelings of graphs of bounded rank-width is in . Our approach builds on the framework of Köbler & Verbitsky (CSR…
cs.DS2024
Logarithmic Weisfeiler--Leman and Treewidth
Michael Levet, Puck Rombach, Nicholas Sieger
In this paper, we show that the -dimensional Weisfeiler--Leman algorithm can identify graphs of treewidth in rounds. This improves the result of Grohe & Ver…