Results 221 to 230 of about 102,063 (249)

FASI: FPGA-friendly Subgraph Isomorphism on Massive Graphs

IEEE International Conference on Data Engineering, 2023
Subgraph 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

Performance Analysis for Subgraph Isomorphism Based Embedding Service Function Chains

IEEE Transactions on Network Science and Engineering, 2023
Embedding Service Function Chains (SFCs) into the network represents scheduling network resources to provide user services. Embedding schemes are affected by many factors, such as the topology of Network Service Requests (NSRs), the demands of NSRs on ...
Shuya Zheng, Zhiyuan Ren, Wenchi Cheng, Hailin Zhang   +3 more
semanticscholar   +1 more source

HiddenCPG: Large-Scale Vulnerable Clone Detection Using Subgraph Isomorphism of Code Property Graphs

The Web Conference, 2022
A 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, Sijae Woo, Joyce Jiyoung Whang, Sooel Son   +3 more
semanticscholar   +1 more source

Efficient Streaming Subgraph Isomorphism with Graph Neural Networks

Proceedings of the VLDB Endowment, 2021
Queries to detect isomorphic subgraphs are important in graph-based data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do
Chi Thang Duong, T. Hoang, Hongzhi Yin, M. Weidlich, Q. Nguyen, K. Aberer   +5 more
semanticscholar   +1 more source

A Subgraph Isomorphism-based Attack Towards Social Networks

WI/IAT, 2021
It has been widely recognized that social network analysis of group relationships and behaviors come to thrive, so publicity social networks have gained growing attention from third-party individuals for academic researchers and advertisers.
Mengjiao Guo, Chi-Hung Chi, Hui Zheng, Jing He, Xiaoting Zhang   +4 more
semanticscholar   +1 more source

Subcircuit Identification Method Based on Subgraph Isomorphism

International Conference on Anti-counterfeiting, Security, and Identification, 2021
With the development of integrated circuits, more and more transistors are integrated on one chip, and the more complex circuit structure on the chip increases the difficulty of the design.
Guangxian Dong, Yalin Zheng, Shan He, Donghui Guo, Lin Li   +4 more
semanticscholar   +1 more source

A Backtracking Algorithmic Toolbox for Solving the Subgraph Isomorphism Problem

Advances in Systems Analysis, Software Engineering, and High Performance Computing, 2021
The subgraph isomorphism problem asks whether a given graph is a subgraph of another graph. It is one of the most general NP-complete problems since many other problems (e.g., Hamiltonian cycle, clique, independent set, etc.) have a natural reduction to ...
J. Mihelic, Uros Cibej, Luka Fürst
semanticscholar   +1 more source

Rapid Mining of Fast Ion Conductors via Subgraph Isomorphism Matching.

Journal of the American Chemical Society
The rapidly evolving field of inorganic solid-state electrolytes (ISSEs) has been driven in recent years by advances in data-mining techniques, which facilitates the high-throughput computational screening for candidate materials in the databases.
Wentao Zhang, Mouyi Weng, Mingzheng Zhang, Zhefeng Chen, Bingxu Wang, Shunning Li, Feng Pan   +6 more
semanticscholar   +1 more source

On the AC0 Complexity of Subgraph Isomorphism

2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014
Let P be a fixed graph (hereafter called a "pattern"), and let Subgraph(P) denote the problem of deciding whether a given graph G contains a subgraph isomorphic to P. We are interested in AC0-complexity of this problem, determined by the smallest possible exponent C(P) for which Subgraph(P) possesses bounded-depth circuits of size nC(P)+o(1). Motivated
Yuan Li, Benjamin Rossman, Alexander A. Razborov   +2 more
openaire   +3 more sources

An Efficient Index-Based Algorithm for Exact Subgraph Isomorphism on Bipartite Graphs

Scientific Research Communications
Graphs are widely used to represent various real-world networks, but their non-linear nature and size increase pose challenges for efficient analysis. The subgraph isomorphism problem, which involves identifying subgraphs that are isomorphic to a query ...
Mehmet Burak Koca, F. E. Sevilgen
semanticscholar   +1 more source