Polynomial Time Algorithm for Graph Isomorphism Testing

Details Polynomial Time Algorithm for Graph Isomorphism Testing Polynomial Time Algorithm for Graph Isomorphism Testing

2010-04-11

arxiv.org/abs/1004.1808v4

Computer Science

Data Structures and Algorithms

9 pages

Scientific paper

Earlier we introduced (M.I.Trofimov, E.A.Smolenskii, Application of the Electronegativity Indices of Organic Molecules to Tasks of Chemical Informatics, Russian Chemical Bulletin 54(2005), 2235-2246. DOI:10.1007/s11172-006-0105-6) effective recursive algorithm for graph isomorphism testing. In this paper we describe used approach and iterative modification of this algorithm, which modification has polynomial time complexity for all graphs.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-186851