TADM2E 7.5

From Algorithm Wiki
Revision as of 09:55, 12 October 2019 by Tcaner (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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.