Results 161 to 170 of about 39,682 (219)
Some of the next articles are maybe not open access.
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
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
Nobuo Funabiki, Junji Kitamichi
openalex +3 more sources
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
Automatic Control and Computer Sciences, 2023V. V. Vasilchikov
openaire +2 more sources
PathLAD+: Towards Effective Exact Methods for Subgraph Isomorphism Problem
Artificial IntelligenceYiyuan Wang, Chenghou Jin, Shaowei Cai
openalex +2 more sources
FASI: FPGA-friendly Subgraph Isomorphism on Massive Graphs
IEEE International Conference on Data Engineering, 2023Subgraph isomorphism plays a significant role in many applications, such as social networks and bioinformatics. However, due to the inherent NP-hardness, it becomes challenging to compute matches efficiently in large real-world graphs.
Xunbin Su, Yinnian Lin, Lei Zou
semanticscholar +1 more source
Stable Subgraph Isomorphism Search in Temporal Networks
IEEE Transactions on Knowledge and Data Engineering, 2023In this paper, we study a new problem of seeking stable subgraph isomorphisms for a query graph in a temporal graph. To solve our problem, we first develop a pruning-based search algorithm using several new pruning tricks to prune the unpromising ...
Qi Zhang +5 more
semanticscholar +1 more source
arXiv.org, 2023
The subgraph isomorphism finding problem is a well-studied problem in the field of computer science and graph theory, and it aims to enumerate all instances of a query graph in the respective data graph.
Z. Ansari +3 more
semanticscholar +1 more source
The subgraph isomorphism finding problem is a well-studied problem in the field of computer science and graph theory, and it aims to enumerate all instances of a query graph in the respective data graph.
Z. Ansari +3 more
semanticscholar +1 more source