graph isomorphism problem
computational problem of determining whether two finite graphs are isomorphic
Facts
4 properties- Instance of
- computational problem
- Facet of
- graph isomorphism[2]
- Computational complexity
- GI-complete[5]
🏷️ Also known as
en graph isomorphism problem
de Graphen-Isomorphismusproblem
es problema del isomorfismo de grafos
fa مسئله یکریختی گراف
fa مسئلهی همریختی گراف
fa مسئلهی یکریختی گراف
fr problème de l'isomorphisme de graphes
he איזומורפיזם של גרפים
he בעיית איזומורפיזם של גרפים
hu gráfizomorfizmus-probléma
it problema dell'isomorfismo tra grafi
ja グラフ同型性判定問題
ja グラフ同型問題
ko 그래프 동형 문제
pt Problema de isomorfismo de grafos
ro problema izomorfismului grafurilor
ru задача изоморфности графов
uk задача ізоморфності графів
zh 图同构问题
zh 图的同构问题
🔖 Identifiers · 3
🔗 Connections
Studied by 2
Facet of 1
Instance of 1
Press Enter · cited answer in seconds
0 sources
Summary
graph isomorphism problem is a computational problem[1].