Skip to search formSkip to main contentSkip to account menu

Induced subgraph isomorphism problem

In complexity theory and graph theory, induced subgraph isomorphism is an NP-complete decision problem that involves finding a given graph as an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Clique (graph theory)Computational complexity theoryDecision problemGraph isomorphism

Search for papers about Induced subgraph isomorphism problem

Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)