Results 121 to 130 of about 3,015 (169)

GSIDroid: A Suspicious Subgraph-Driven and Interpretable Android Malware Detection System. [PDF]

Sensors (Basel)
Huang H, Huang W, Jiang F.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Subgraph matching over graph federation

Proceedings of the VLDB Endowment, 2021
Many real-life applications require processing graph data across heterogeneous sources. In this paper, we define the graph federation that indicates that the graph data sources are temporarily federated and offer their data for users.
Ye Yuan, Delong Ma, Zhenyu Wen, Zhiwei Zhang, Guoren Wang   +4 more
openaire   +1 more source

Subgraph matching

Proceedings of the VLDB Endowment, 2017
Subgraph matching finds a set I of all occurrences of a pattern graph in a target graph. It has a wide range of applications while suffers an expensive computation. This efficiency issue has been studied extensively.
Miao Qiao, Hao Zhang, Hong Cheng
openaire   +1 more source

Inexact Attributed Subgraph Matching

2020 IEEE International Conference on Big Data (Big Data), 2020
We present an approach for inexact subgraph matching on attributed graphs optimizing the graph edit distance. By combining lower bounds on the cost of individual assignments, we obtain a heuristic for a backtracking tree search to identify optimal solutions.
Thomas K. Tu, Jacob D. Moorman, Dominic Yang, Qinyi Chen, Andrea L. Bertozzi   +4 more
openaire   +1 more source

Subgraph matching on temporal graphs

Information Sciences, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Faming, Zou, Zhaonian
openaire   +1 more source

Efficient Subgraph Matching

Proceedings of the 2019 International Conference on Management of Data, 2019
Subgraph matching (or subgraph isomorphism) is one of the fundamental problems in graph analysis. Extensive research has been done to develop practical solutions for subgraph matching. The state-of-the-art algorithms such as \textsfCFL-Match and \textsfTurbo\textsubscriptiso convert a query graph into a spanning tree for obtaining candidates for each ...
Myoungji Han, Hyunjoon Kim, Geonmo Gu, Kunsoo Park, Wook-Shin Han   +4 more
openaire   +1 more source

Subgraphs of Random Match-Graphs

Graphs and Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jaworski, Jerzy, Palka, Zbigniew
openaire   +1 more source

Efficient GPU-Accelerated Subgraph Matching

Proceedings of the ACM on Management of Data, 2023
Subgraph matching is a basic operation in graph analytics, finding all occurrences of a query graph Q in a data graph G. A common approach is to first filter out non-candidate vertices in G, and then order the vertices in Q to enumerate results. Recent work has started to utilize the GPU to accelerate subgraph matching.
Xibo Sun, Qiong Luo
openaire   +1 more source

Forbidden Induced Subgraphs for Perfect Matchings

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ota, Katsuhiro, Sueiro, Gabriel
openaire   +1 more source

Scaling Up Subgraph Query Processing with Efficient Subgraph Matching

2019 IEEE 35th International Conference on Data Engineering (ICDE), 2019
A subgraph query finds all data graphs in a graph database each of which contains the given query graph. Existing work takes the indexing-filtering-verification (IFV) approach to first index all data graphs, then filter out some of them based on the index, and finally test subgraph isomorphism on each of the remaining data graphs.
Shixuan Sun, Qiong Luo
openaire   +1 more source