The Complexity of Subgraph Isomorphism Duality Results for Graphs of Bounded Path and Tree Width

@inproceedings{Gupta1995TheCO,
  title={The Complexity of Subgraph Isomorphism Duality Results for Graphs of Bounded Path and Tree Width},
  author={Arvind Gupta and Naomi Nishimura},
  year={1995}
}
We present a clear demarcation between classes of bounded tree width graphs for which the subgraph isomorphism problem is NP complete and those for which it can be solved in polynomial time In previous work it has been shown that this problem is solvable in polynomial time if the source graph has either bounded degree or is k connected for k the tree width of the two graphs As well it has also been shown that for certain speci c connectivity or degree conditions the problem becomes NP complete… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Subtree isomorphism in O(n5=2)

D. MATULA
Annals of Discrete Mathematics • 1978

Murty

J. BONDY, U.S.R
\Graph Theory with Applications," North-Holland, • 1976
View 2 Excerpts

Similar Papers

Loading similar papers…