274 citations · 1.8k across the 48 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2023
Continuous optimization methods for the graph isomorphism problem
Stefan Klus, Patrick Gelß
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degr…
cs.DM2017★ 5 cited
Continuous Relaxations for the Traveling Salesman Problem
Tuhin Sahai, Adrian Ziessler, Stefan Klus +1
In this work, we aim to explore connections between dynamical systems techniques and combinatorial optimization problems. In particular, we construct heuristic approaches for the t…
cs.DM2014★ 7 cited
A Spectral Assignment Approach for the Graph Isomorphism Problem
Stefan Klus, Tuhin Sahai
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graph…