Isomorphism of graphs-a polynomial test

Details Isomorphism of graphs-a polynomial test Isomorphism of graphs-a polynomial test

2005-07-06

arxiv.org/abs/cs/0507014v1

Computer Science

Data Structures and Algorithms

Scientific paper

An explicit algorithm is presented for testing whether two non-directed
graphs are isomorphic or not. It is shown that for a graph of n vertices, the
number of n independent operations needed for the test is polynomial in n. A
proof that the algorithm actually performs the test is presented.

Affiliated with

Also associated with

No associations

Rating

Isomorphism of graphs-a polynomial test 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 Isomorphism of graphs-a polynomial test, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isomorphism of graphs-a polynomial test will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611426