Talk:Induced subgraph isomorphism problem
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Why is this is a new page?
[edit]The problem is only minimally different from subgraph isomorphism. Replacing implication by equivalence would change the latter into the former. Moreover, the new page does not provide any new references nor any pointers to results specifically about this problem. As long as this is the case, a new page is not warranted. —Preceding unsigned comment added by 128.197.164.27 (talk) 00:48, 29 December 2010 (UTC)
- I added a small section on differences from a computational complexity point of view between the two problems, as well as a few references (not to my own work).Alabarre (talk) 10:49, 30 May 2013 (UTC)