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… (More)

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

2017

2017

- Uroš Čibej, Jurij Mihelič
- 2017 IEEE 14th International Scientific…
- 2017

Subgraph isomorphism is one of the fundamental search problems in computer science. In this article we consider the counting… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Jens Lischka, Holger Karl
- VISA
- 2009

Assigning the resources of a virtual network to the components of a physical network, called Virtual Network Mapping, plays a… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Luigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento
- IEEE Transactions on Pattern Analysis and Machine…
- 2004

We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of… (More)

Is this relevant?

2002

2002

- Shuichi Ichikawa, Shoji Yamamoto
- FPL
- 2002

The subgraph isomorphism problem has various important applications, although it is generally NP-complete and difficult to solve… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Michihiro Kuramochi, George Karypis
- ICDM
- 2001

Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Bruno T. Messmer, Horst Bunke
- IEEE Trans. Knowl. Data Eng.
- 2000

ÐGraphs are a powerful and universal data structure useful in various subfields of science and engineering. In this paper, we… (More)

Is this relevant?

2000

2000

Many applications can be m o deled a s s u b graph iso-morphism problems, which are g e n e r ally NP-complete. This paper… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- David Eppstein
- J. Graph Algorithms Appl.
- 1995

We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are… (More)

Is this relevant?

1982

1982

- Maciej M. Syslo
- Theor. Comput. Sci.
- 1982

This paper deals with the: subgraph isomorphism problem for outerplanar graphs (SUBOUTISOM). In general, since trees and forests… (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- Julian R. Ullmann
- J. ACM
- 1976

Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm… (More)

Is this relevant?