Subgraph isomorphism problem

Known as: Subgraph isomorphism, Subgraph matching, Substructure search

In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

Non-linear kernel methods can be approximated by fast linear ones using suitable explicit feature maps allowing their application…

2014

In a previous paper, we laid out the vision of a novel graph query processing paradigm where instead of processing a visual query…

2013

This thesis describes the problem of finding subgraph isomorphism. This is one of the most basic operations performed on graphs…

2011

Network motifs refer to recurrent patterns of interconnections which are found to be over-represented in real networks when…

2007

The present work studies symmetry breaking for the subgraph isomorphism problem. This NP-Complete problem decides if a pattern…

2005

Subgraph Isomorphism Detection is an important problem for several computer science subfields, where a graph-based representation…

1988

Substructure search on large databases often exceeds the limits of interactive computer systems. To avoid this difficulty the…

1979

1972

1968