Tcaner: Created page with "This is no different than the graph isomorphism problem. You just have to add an extra backtracking step in the beginning to form every possible subgraph of the original graph..."

2019-10-12T09:55:39Z

Created page with "This is no different than the graph isomorphism problem. You just have to add an extra backtracking step in the beginning to form every possible subgraph of the original graph..."

New page

This is no different than the graph isomorphism problem. You just have to add an extra backtracking step in the beginning to form every possible subgraph of the original graph, and test them one by one for graph isomorphism.

TADM2E 7.5 - Revision history

Tcaner: Created page with "This is no different than the graph isomorphism problem. You just have to add an extra backtracking step in the beginning to form every possible subgraph of the original graph..."