A Polynomial Time Algorithm for Graph Isomorphism

Details A Polynomial Time Algorithm for Graph Isomorphism A Polynomial Time Algorithm for Graph Isomorphism

2007-11-13

arxiv.org/abs/0711.2010v4

Computer Science

Computational Complexity

Scientific paper

Algorithms testing two graphs for isomorphism known as yet in computer
science have exponential worst case complexity. In this paper we propose an
algorithm that has polynomial complexity and constructively supplies the
evidence that the graph isomorphism lies in P.

Affiliated with

Also associated with

No associations

Rating

A Polynomial Time Algorithm for Graph Isomorphism 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 A Polynomial Time Algorithm for Graph Isomorphism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Polynomial Time Algorithm for Graph Isomorphism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271440