Computer Science – Computational Complexity
Scientific paper
2010-07-07
Computer Science
Computational Complexity
Microsoft Wopd 2007 46 pages with 38 figures
Scientific paper
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the help of the effective algorithms without their preliminary plotting, etc. The examining of the transformation of the vertex graphs into the edge graph and the opposite operation illustrates the reasons of the appearance of the NP-completeness from the point of view of the graph theory. We suggest that it also illustrates the synchronous possibility and impossibility of the struggle with the NP-completeness.
Malinin Leonid
Malinina Natalia
No associations
LandOfFree
On the solution of the Graph Isomorphism Problem Part 1 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 the Graph Isomorphism Problem Part 1, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the solution of the Graph Isomorphism Problem Part 1 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-345023