Results 21 to 30 of about 101,745 (269)
GSI: GPU-friendly Subgraph Isomorphism [PDF]
2020 IEEE 36th International Conference on Data Engineering (ICDE), 2019 Subgraph isomorphism is a well-known NP-hard problem that is widely used in many applications, such as social network analysis and querying over the knowledge graph.
Li Zeng +4 more
semanticscholar +4 more sources
Low-Power Subgraph Isomorphism at the Edge Using FPGAs
IEEE AccessSubgraph matching is a significant problem in several fields, including like social network analysis, chemical compound search, and fraud detection. While current solutions using CPU, graphics processing units (GPUs), and data center field-programmable ...
Roberto Bosio +5 more
doaj +2 more sources
Static graph challenge: Subgraph isomorphism [PDF]
2017 IEEE High Performance Extreme Computing Conference (HPEC), 2017 The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties.
S. Samsi +11 more
semanticscholar +5 more sources
Efficient Large-Scale IoT Botnet Detection through GraphSAINT-Based Subgraph Sampling and Graph Isomorphism Network [PDF]
MathematicsIn recent years, with the rapid development of the Internet of Things, large-scale botnet attacks have occurred frequently and have become an important challenge to network security.
Lihua Yin +3 more
doaj +2 more sources
Parallel Planar Subgraph Isomorphism and Vertex Connectivity [PDF]
ACM Symposium on Parallelism in Algorithms and Architectures, 2020 We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bounded treewidth.
Lukas Gianinazzi, Torsten Hoefler
openalex +3 more sources
Set-Centric Subgraph Isomorphism
, 2021 We investigate techniques for accelerating subgraph isomorphism (SI). SI is the task of finding occurrences of a pattern graph in a target graph and relevant to many practical applications. Our key idea is to use set algebra based formulations of SI.
Lukas Kapp-Schwoerer
semanticscholar +4 more sources
Subgraph isomorphism in graph classes
Discrete Mathematics, 2012 AbstractWe investigate the computational complexity of the following restricted variant of Subgraph Isomorphism: given a pair of connected graphs G=(VG,EG) and H=(VH,EH), determine if H is isomorphic to a spanning subgraph of G. The problem is NP-complete in general, and thus we consider cases where G and H belong to the same graph class such as the ...
Shuji Kijima +3 more
openalex +2 more sources
A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation [PDF]
Entropy, 2023 In order to implement a quantum circuit on an NISQ device, it must be transformed into a functionally equivalent circuit that satisfies the device’s connectivity constraints.
Yang Qian +3 more
doaj +2 more sources
Taming Subgraph Isomorphism for RDF Query Processing [PDF]
Proceedings of the VLDB Endowment, 2015 RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples. This calls for a framework for efficiently processing RDF data. The core function of processing RDF data is subgraph pattern matching.
Jinha Kim +4 more
openalex +5 more sources
Subgraph Isomorphism on Graph Classes that Exclude a Substructure [PDF]
Algorithmica, 2019 We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus on the minor relation since other well-known relations lead to either ...
H. Bodlaender +6 more
semanticscholar +12 more sources