6 citations · 10 across the 4 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020★ 3 cited
Automorphism groups of graphs of bounded Hadwiger number
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particu…
cs.DS2020★ 6 cited
Isomorphism Testing for Graphs Excluding Small Minors
Martin Grohe, Daniel Neuen, Daniel Wiebking
We prove that there is a graph isomorphism test running in time on -vertex graphs excluding some -vertex graph as a minor. Previously known bo…
cs.LO2020
Deep Weisfeiler Leman
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL), which allows the design of purely combinatorial graph isomorphism tests that are more powerful than the wel…