On the Solution of Graph Isomorphism by Dynamical Algorithms

Details On the Solution of Graph Isomorphism by Dynamical Algorithms On the Solution of Graph Isomorphism by Dynamical Algorithms

2005-05-27

arxiv.org/abs/cs/0505076v1

Computer Science

Computational Complexity

20 pages

Scientific paper

In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this dynamical algorithm is covered by a combinatorial approach. It is possible to infer that polynomial dynamical algorithms addressing graph isomorphism are covered by suitable polynomial combinatorial approaches and thus are tackled by the same weaknesses as the last ones.

Affiliated with

Also associated with

No associations

Rating

On the Solution of Graph Isomorphism by Dynamical Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Solution of Graph Isomorphism by Dynamical Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Solution of Graph Isomorphism by Dynamical Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522677