Subgraph isomorphism problem
Semantic Scholar uses AI to extract papers important to this topic.
Subgraph isomorphism is one of the fundamental search problems in computer science. In this article we consider the counting… (More)
Assigning the resources of a virtual network to the components of a physical network, called Virtual Network Mapping, plays a… (More)
We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of… (More)
The subgraph isomorphism problem has various important applications, although it is generally NP-complete and difficult to solve… (More)
Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining… (More)
- IEEE Trans. Knowl. Data Eng.
ÐGraphs are a powerful and universal data structure useful in various subfields of science and engineering. In this paper, we… (More)
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)
- J. Graph Algorithms Appl.
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are… (More)
This paper deals with the: subgraph isomorphism problem for outerplanar graphs (SUBOUTISOM). In general, since trees and forests… (More)
Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm… (More)