this post was submitted on 13 Mar 2024
4 points (83.3% liked)

Ask Math Problems

121 readers
2 users here now

founded 1 year ago
MODERATORS
[email protected]
4
Graph isomorphism (sopuli.xyz)
submitted 1 year ago* (last edited 1 year ago) by [email protected] to c/[email protected]
7 comments fedilink hide all child comments
 

Definitions

A graph G = (V, E) is a set of nodes V and a set of undirected edges E. An undirected edge is a set of two vertices.

Two graphs G1 = (V1, E1) and G2 = (V2, E2) are isomorph if there is a bijective mapping f from V1 to V2 such that f(E1) = E2. Applying f to E1 means applying it to each node in each edge in E1.

Problem

Is there an algorithm that decides if two arbitrary graphs are isomorphic in polynomial time?

you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 2 points 1 year ago

Fixed