Results 151 to 160 of about 17,360 (200)
Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem
, 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
Audemard, Gilles +4 more
openaire +3 more sources
Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem
International Journal of Pattern Recognition and Artificial Intelligence, 2015 The 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 ...
Uroš Čibej, Jurij Mihelič
openaire +2 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.
null Yuan-Kai Wang +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), 2019 Subgraph 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
Mehmet Burak Koca +1 more
openaire +2 more sources
A three-stage greedy and neural-network approach for the subgraph isomorphism problem
SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), 2002 This paper presents a three-stage greedy and neural-network algorithm for the subgraph isomorphism problem. Given two graphs of G=(V/sub 1/,E/sub 1/) and H=(V/sub 2/,E/sub 2/), the goal of this NP-complete problem is to find a subgraph of H isomorphic to G. The proposed algorithm consists of three stages. The first stage extracts a set of vertices in H
N. Funabiki, J. Kitamichi
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Data Dependent Circuit for Subgraph Isomorphism Problem
2002The subgraph isomorphism problem has various important applications, although it is generally NP-complete and difficult to solve. This paper examines the feasibility of a data dependent circuit for the subgraph isomorphism problem, which is particularly suitable for FPGA implementation.
Shuichi Ichikawa, Shoji Yamamoto
openaire +1 more source
A hybrid incremental genetic algorithm for subgraph isomorphism problem
Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014Finding an isomorphic subgraph is a key problem in many real world applications modeled on graph. In this paper, we propose a new hybrid genetic algorithm(GA) for subgraph isomorphism problem which uses an incremental approach. We solve the problem with increasing the size of the subproblem step by step.
HyukGeun Choi +2 more
openaire +1 more source
Evaluation of Accelerator Designs for Subgraph Isomorphism Problem
2000Many 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.
Shuichi Ichikawa +3 more
openaire +1 more source
Investigation of incremental hybrid genetic algorithm with subgraph isomorphism problem
Swarm and Evolutionary Computation, 2019Abstract 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 ...
HyukGeun Choi +3 more
openaire +1 more source