Results 141 to 150 of about 23,139 (195)
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
PathLAD+: Towards Effective Exact Methods for Subgraph Isomorphism Problem
Artificial IntelligenceYiyuan Wang, Chenghou Jin, Shaowei Cai
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
HiddenCPG: Large-Scale Vulnerable Clone Detection Using Subgraph Isomorphism of Code Property Graphs
The Web Conference, 2022A code property graph (CPG) is a joint representation of syntax, control flows, and data flows of a target application. Recent studies have demonstrated the promising efficacy of leveraging CPGs for the identification of vulnerabilities.
Seongil Wi +3 more
semanticscholar +1 more source
Problems of synthesis of connected networks with respect to isomorphic subgraphs
Cybernetics and Systems Analysis, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Isomorphic Subgraph-based Problem Reduction for Resource Minimal Modulo Scheduling
2019 International Conference on ReConFigurable Computing and FPGAs (ReConFig), 2019Modulo scheduling is a powerful method to increase throughput in high-level synthesis for digital hardware design. When facing large designs, optimal approaches are likely to time out and heuristics fail to provide satisfying throughput and latency. We propose an isomorphic subgraph-based reduction of the input data-flow graph (DFG) that is applied ...
Nicolai Fiege +3 more
openaire +1 more source
On the computational power of the light: An optical method for the subgraph isomorphism problem
Advances in Complex Systems, 2023J. S. Sartakhti, M. K. Nahari
semanticscholar +1 more source
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
Automatic Control and Computer Sciences, 2023V. V. Vasilchikov
semanticscholar +1 more source