Results 131 to 140 of about 23,139 (195)
Some of the next articles are maybe not open access.
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
Solving the Subgraph Isomorphism Problem Using Harmony Search
MUE/FutureTech, 2017The active usage of open source software contributes many areas. However, there are many problems like ignoring license or intellectual properties infringement which can lead litigation. In this paper, we try to find original open source software by using similarity of source code.
Hyoguen Bang +4 more
openaire +3 more sources
Approximating the maximum common subgraph isomorphism problem with a weighted graph
Knowledge-Based Systems, 2015The maximum common subgraph isomorphism problem is a difficult graph problem, and the problem of finding the maximum common subgraph isomorphism problem is NP-hard. This means there is likely no algorithm that will be able to find the maximal isomorphic common subgraph in polynomial time because as the size of the graphs grows the search space for the ...
Alan Chia-Lung Chen +6 more
openaire +3 more sources
Data Dependent Circuit for Subgraph Isomorphism Problem
, 2002 The 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.
Shûichi Ichikawa, Shoji Yamamoto
openalex +3 more sources
Reductions between the Subgraph Isomorphism Problem and Hamiltonian and SAT Problems
17th International Conference on Electronics, Communications and Computers (CONIELECOMP'07), 2007 Subgraph isomorphism (SI) detection is an important problem for several computer science subfields. In this paper we present a study of the subgraph isomorphism problem (SIP) and its relation with the Hamiltonian cycles and SAT problems. In particular, we describe how instances of those problems can be solved throughout SI detection (using problems ...
Iván Olmos +2 more
openalex +3 more sources