{"version":"1.0","type":"link","title":"Subgraph isomorphism problem - Newikis","description":"In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs and are given as input, and one must determine whether contains a subgraph that is isomorphic to . Subgraph isomorphism is a generalization of both the maximum clique problem and the…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/b/b1/Subgraph_isomorphism.svg/1280px-Subgraph_isomorphism.svg.png","thumbnail_width":1280,"thumbnail_height":868}