Computational complexity of computing a partial solution for the Graph Automorphism problems.

Takayuki Nagoya Seinosuke Toda

Published in: Theor. Comput. Sci. (2009)

Keyphrases

partial solutions
computational complexity
np complete
database systems
bipartite graph
special case
np hard
random walk
computationally efficient
multi objective
computational cost
co occurrence
optimization problems
graph model
stochastic sampling