Graph Isomorphism, Bounded Number of Vertices of Each Color

Given two colored graphs with the number of vertices of each color bounded, determine whether they are isomorphic to one another.

Parameters

$n$ : number of vertices in the larger graph

Related Problems

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 1 of 1 algorithms

				See more
Babai	1980	$o(\exp(2n^{1/2}\log^2 n))$	$O(n^2)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table