Results 1  10
of
28,203
On Subgraph Isomorphism
, 802
"... Abstract—Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system. ..."
Abstract
 Add to MetaCart
Abstract—Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.
An algorithm for subgraph isomorphism
 JOURNAL OF THE ACM
, 1976
"... Subgraph isomorphism can be determined by means of a bruteforce treesearch enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph is ..."
Abstract

Cited by 341 (1 self)
 Add to MetaCart
Subgraph isomorphism can be determined by means of a bruteforce treesearch enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph
Subgraph Isomorphism in Polynomial Time
, 1995
"... In this paper, we propose a new approach to the problem of subgraph isomorphism detection. The new method is designed for systems which differentiate between graphs that are a priori known, socalled model graphs, and unknown graphs, socalled input graphs. The problem to be solved is to find a subg ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
In this paper, we propose a new approach to the problem of subgraph isomorphism detection. The new method is designed for systems which differentiate between graphs that are a priori known, socalled model graphs, and unknown graphs, socalled input graphs. The problem to be solved is to find a
PLANAR SUBGRAPH ISOMORPHISM REVISITED
, 2009
"... Ten years after Eppstein’s results on planar subgraph isomorphism for ksized patterns, we improve the exponential term of the running time 2 O(k log k) · n of Eppstein’s algorithm to 2 O(k) (keeping the term in n linear!) Next to deciding subgraph isomorphism, we can construct a solution and enume ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Ten years after Eppstein’s results on planar subgraph isomorphism for ksized patterns, we improve the exponential term of the running time 2 O(k log k) · n of Eppstein’s algorithm to 2 O(k) (keeping the term in n linear!) Next to deciding subgraph isomorphism, we can construct a solution
P.: Filtering for Subgraph Isomorphism
 In: CP 2007. LNCS 4741
, 2007
"... Abstract. A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this problem. The main idea is to label every node with respect to its relationships with other nodes of the graph, ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract. A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this problem. The main idea is to label every node with respect to its relationships with other nodes of the graph
Hardware accelerator for subgraph isomorphism problems
 Proc. of the IEEE Symposium on FieldProgrammable Custom Computing Machines
, 2000
"... Many applications can be modeled assubgraph isomorphism problems, which are generally NPcomplete. This paper presents an algorithm that is suited for hardware implementation. The prototype accelerator that operates at 16.5 MHzon a Lucent ORCA 2C15A FPGA outperforms the software implementation of Ul ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
of Ullmann's algorithm on a 400 MHzPentium II by 10 times in the best case. 1 Subgraph Isomorphism Many applications, including scene analysis and chemical structural formula databases, are modeled as subgraph isomorphism problems. However, subgraph isomorphism is generally NPcomplete [1] and di cult
Subgraph Isomorphism in Planar Graphs and Related Problems
, 1999
"... We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small treewidth, and applying dynamic programming within each piece. The same methods can be used to ..."
Abstract

Cited by 153 (3 self)
 Add to MetaCart
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small treewidth, and applying dynamic programming within each piece. The same methods can be used
A Relational View of Subgraph Isomorphism
"... . This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, combined with a representation of relations and graphs by Boolean functions, allows to handle the combinatorial explos ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, combined with a representation of relations and graphs by Boolean functions, allows to handle the combinatorial
Understanding the Complexity of Induced Subgraph Isomorphisms
"... Abstract. We study lefthand side restrictions of the induced subgraph isomorphism problem: Fixing a class C, for given graphs G ∈ C and arbitrary H we ask for induced subgraphs of H isomorphic to G. For the homomorphism problem this kind of restriction has been studied by Grohe and Dalmau, Kolaitis ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. We study lefthand side restrictions of the induced subgraph isomorphism problem: Fixing a class C, for given graphs G ∈ C and arbitrary H we ask for induced subgraphs of H isomorphic to G. For the homomorphism problem this kind of restriction has been studied by Grohe and Dalmau
Results 1  10
of
28,203