Results 1  10
of
699
An Algorithm Portfolio for the SubGraph Isomorphism Problem
"... Abstract. This work presents an algorithm for the subgraph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a new association between two vertices is compatible by considering the structure of their local neighborhoods, represent ..."
Abstract
 Add to MetaCart
Abstract. This work presents an algorithm for the subgraph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a new association between two vertices is compatible by considering the structure of their local neighborhoods
A Database of Graphs for Isomorphism and SubGraph Isomorphism Benchmarking
"... Despite of the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that the choice of an appropriate algorithm for a given application is still the most crucial task. The lack of a wide database of graphs make it difficult the tas ..."
Abstract
 Add to MetaCart
of isomorphism and graphsubgraph isomorphism algorithms. The 72,800 couples are split into 18,200 couples of isomorphic graphs and 54,600 couples of graphs with a subgraph isomorphism mapping among them. The graphs include different categories as Randomly
Structural Clustering Multimedia Documents: An Approach based on Semantic SubGraph Isomorphism
"... The works that used graphs to represent documents has referred to the richness of these expressive tools. However, the exploited graph theory could be of great interest concerning the evaluation of similarity between these documents, both in documentary classification and the information retrieval. ..."
Abstract
 Add to MetaCart
as a set of paths that compose it. The matching, paths allows reducing the combinatorial cost. We propose a structural measure based on the subgraph isomorphism and we discuss the quality of our classifier, especially the separation of classes. We’d like to show that our measure is structural, not a
Algorithms for computing the Automorphism Group of a Graph and Sub Graph Isomorphism
"... In this report we present a brief survey of the existing algorithms for Computing the Automorphism Group of a graph, algorithms to compute Sub Graph Isomorphism(SGI) and also present some important results on Spectrum of a Graph. Graph Isomorphism(GI) has been a great interest of computer scientists ..."
Abstract
 Add to MetaCart
In this report we present a brief survey of the existing algorithms for Computing the Automorphism Group of a graph, algorithms to compute Sub Graph Isomorphism(SGI) and also present some important results on Spectrum of a Graph. Graph Isomorphism(GI) has been a great interest of computer
A database of graphs for isomorphism and subgraph isomorphism benchmarking
 CoRR
, 2001
"... Despite of the fact that graph based methods are gaining more and more popularity in different scientific areas, it has to be considered that the choice of an appropriate algorithm for a given application is still the most crucial task. The lack of a large database of graphs makes the task of compar ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
the performance of isomorphism and graphsubgraph isomorphism algorithms. The 72,800 couples are split into 18,200 couples of isomorphic graphs and 54,600 couples of graphs with a subgraph isomorphism mapping among them. The graphs include different categories
Design Pattern Detection using Genetic Algorithm for Subgraph Isomorphism to Enhance Software
"... Design patterns have been proposed as a technique to introduce reuse in design phase. In industry, it is focused to reuse design patterns as a reusable part when designing a new application. Reusable Design Pattern, that are proven solutions to common design problems, to improves many qualities of a ..."
Abstract
 Add to MetaCart
software reusability. The techniques of finding an isomorphic subgraph were used to solve design pattern detection in past. Furthermore, we are applying a hybrid genetic algorithm for subgraph isomorphism problem which uses an incremental approach to detect design patterns. Moreover, detection is done
Application of SubGraph Isomorphism to Extract Reoccurring Structures from BPMN 2.0 Process Models
, 2015
"... © 2015 IEEE Computer Society. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of thi ..."
Abstract
 Add to MetaCart
© 2015 IEEE Computer Society. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
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 347 (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 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 150 (2 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
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
of two given graphs is isomorphic to a subgraph of the second. Other examples are discussed. A method of measuring the complexity of proof procedures for the predicate calculus is introduced and discussed. Throughout this paper, a set of strings 1 means a set of strings on some fixed, large, finite
Results 1  10
of
699