Results 151 to 160 of about 39,682 (219)
Developing Heuristic for Subgraph Isomorphism Problem
International Conference on Contemporary Computing, 2012 Subgraph isomorphism problem is an NP-hard problem and the available algorithms are of exponential time complexity. Hence these are not efficient for real world applications. A number of heuristic methods are proposed in the literature in this field. Ullmann[6] proposed a solution for subgraph isomorphism problem in 1976, which is being referred till ...
Saifuddin Kaijar, S. Durga Bhavani
semanticscholar +4 more sources
A genetic and iterative local search algorithm for solving subgraph isomorphism problem
2015 International Conference on Industrial Engineering and Operations Management (IEOM), 2015 Finding the subgraph of a graph that is isomorphic to a given graph has practicalapplications in several fields, from cheminformatics to image understanding. Since subgraph isomorphismproblem is NP-Hard, meta-heuristics are of especial use and importance in solving it. In this paper a hybrid metaheuristic algorithm for subgraph isomorphism is proposed.
Mina Mazraeh Farahani, S K Chaharsoughi
semanticscholar +4 more sources
Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem
International Conference on Principles and Practice of Constraint Programming, 2014 This paper presents an original filtering approach, called SND (Scoring-based Neighborhood Dominance), for the subgraph isomorphism problem. By reasoning on vertex dominance properties based on various scoring and neighborhood functions, SND appears to be a filtering mechanism of strong inference potential. For example, the recently proposed method LAD
Gilles Audemard +4 more
semanticscholar +5 more sources
Hardware accelerator for subgraph isomorphism problems [PDF]
Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871), 2002 Many applications can be modeled as subgraph isomorphism problems, which are generally NP-complete. This paper presents an algorithm that is suited for hardware implementation. The prototype accelerator that operates at 16.5 MHz on a Lucent ORCA 2C15A FPGA outperforms the software implementation of Ullmann's algorithm on a 400 MHz Pentium II by 10 ...
Shûichi Ichikawa +2 more
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem
International Journal of Pattern Recognition and Artificial Intelligence, 2015The subgraph isomorphism problem is one of the most important problems for pattern recognition in graphs. Its applications are found in many different disciplines, including chemistry, medicine, and social network analysis. Because of the [Formula: see text]-completeness of the problem, the existing exact algorithms exhibit an exponential worst-case ...
Jurij Mihelič, Uros Cibej
openaire +3 more sources
Investigation of incremental hybrid genetic algorithm with subgraph isomorphism problem [PDF]
Swarm and Evolutionary Computation, 2019 Abstract Graph pattern matching is a key problem in many applications which data is represented in the form of a graph, and this problem is generally defined as a subgraph isomorphism. In this paper, we analyze an incremental hybrid genetic algorithm for the subgraph isomorphism problem considering various design issues to improve the performance of ...
Yourim Yoon +3 more
openaire +2 more sources
A Novel Approach for Subgraph Isomorphism Problem on Bipartite Graphs
2019 27th Signal Processing and Communications Applications Conference (SIU), 2019Subgraph isomorphism problem on specialized graphs is an open research area. Most of the algorithms that had been developed for subgraph isomorphism problem are designed for general graphs. Although, they can be utilized for any graph type, this generic design prevents to take advantages of characteristics of the specialized graphs to burst performance
Fatih Erdogan Sevilgen +1 more
openaire +3 more sources
Adaptive optimization for solving a class of subgraph isomorphism problems
Proceedings of 1995 IEEE International Conference on Evolutionary Computation, 2002 In this paper, genetic algorithms are applied to solve the error-correcting subgraph isomorphism ("I) problems. The error-correcting subgraph isomorphism problems are first formulated as permutation searching problems. Two ECSl algorithms are devised. The first algorithm implements pure genetic algorithms with permutation representation.
Yuan-Kai Wang +3 more
openalex +3 more sources
2019 IEEE 15th International Scientific Conference on Informatics, 2019
A well-known $\mathcal{N}\mathcal{P}$-hard problem from graph theory is the subgraph isomorphism problem where the goal is for given pattern and target graphs to determine whether the pattern is a subgraph of the target graph. A plethora of algorithms for solving the problem exist in literature and most of them are based on the backtracking approach ...
Uros Cibej, Jurij Mihelič
openaire +3 more sources
A well-known $\mathcal{N}\mathcal{P}$-hard problem from graph theory is the subgraph isomorphism problem where the goal is for given pattern and target graphs to determine whether the pattern is a subgraph of the target graph. A plethora of algorithms for solving the problem exist in literature and most of them are based on the backtracking approach ...
Uros Cibej, Jurij Mihelič
openaire +3 more sources
Evaluation of Accelerator Designs for Subgraph Isomorphism Problem
, 2000 Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospective solution for such problems. This paper examines various accelerator designs, and compares them quantitatively from two points of view: cost and performance.
Shûichi Ichikawa +3 more
openalex +3 more sources