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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Graph Pattern Polynomials
Given a host graph G and a pattern graph H, the induced subgraph isomorphism problem is to decide whether G contains an induced… 
2010
2010
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to… 
2008
2008
Parameterized graph cleaning problems
2006
2006
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G = (V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset… 
1990
1990
Induced Subgraph Isomorphism for Cographs in NP-Complete
We prove by a reduction from 3SAT that the INDUCED SUBGRAPH ISOMORPHISM problem remains NP-complete when restricted to cographs… 
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)