Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

graph isomorphism problem · Vinony

🌐English

English Deutsch Español Français Italiano Português Русский فارسی 中文日本語

EntityQ3738036· pop 9· linked from 51 articles

graph isomorphism problem

computational problem of determining whether two finite graphs are isomorphic

Available in 9 languages

Español
Français
Deutsch
Русский
Português
Estonian
Serbian
فارسی

via Wikidata sitelinks · CC0

Connections

convex polytope

computer vision

Categories

Computational complexity theory Computational problems in graph theory Graph algorithms Morphisms Quasi-polynomial time algorithms Unsolved problems in computer science

Sources

wikipedia.externallinksexternallink

NP

Entity

time complexity

graph automorphism

International Standard Book Number

chemical compound

digital object identifier

International Standard Serial Number

chemical substance

electrical circuit

commutative property

equivalence relation

Sign in to save

What links here51 pages

zero-knowledge proof

polynomial-time reduction

P versus NP problem

Fulkerson Prize

Las Vegas algorithm

Harald Helfgott

computational complexity theory

time complexity

classification of finite simple groups

subgraph isomorphism problem

graph isomorphism

timeline of mathematics

NP-intermediate

self-complementary graph

convex polytope

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.56

community structure

Entitydist 0.57

perfect graph theorem

Entitydist 0.57

hypercube graph

Entitydist 0.57

Category:Individual graphs

Entitydist 0.59

Entitydist 0.59

Entitydist 0.60

Entitydist 0.61

Entitydist 0.61

Category:Graphs

Entitydist 0.62

Category:Directed acyclic graphs

Entitydist 0.62

Category:Perfect graphs

Entitydist 0.62