<p>Has anyone (that we know of) ever actually implemented László Babai's algorithm for graph isomorphism in quasipolynomial time? If not, would such a thing even be possible/feasible?</p>

CC BY-SA 4.0
2024-08-31T01:58:51.960Z
Not that I know of. Why though, what are you looking for?
Joshua Grochow
CC BY-SA 4.0
2024-08-31T14:16:44.650Z
Honestly it was just a question that came to mind when watching the presentation he gave on the algorithm. I'm aware that there probably aren't any practical applications for it.
bigsapphicdisaster
<graph-theory><graph-isomorphism>
Implementation of László Babai's Graph Isomorphism Algorithm
bigsapphicdisaster
# Implementation of László Babai's Graph Isomorphism Algorithm

(Asked by: username_0 on 2024-08-30)

Has anyone (that we know of) ever actually implemented László Babai's algorithm for graph isomorphism in quasipolynomial time? If not, would such a thing even be possible/feasible?

**Tags:** graph-theory, graph-isomorphism

> **Comments:**
> **username_1**: Not that I know of. Why though, what are you looking for?  
> **username_0**: Honestly it was just a question that came to mind when watching the presentation he gave on the algorithm. I'm aware that there probably aren't any practical applications for it.  

---

## 0 answers

