Top-<inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> Subgraph Query Based on Frequent Structure in Large-Scale Dynamic Graphs

Top-<inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> Subgraph Query Based on Frequent Structure in Large-Scale Dynamic Graphs

Frequent structures have emerged as resolving the structural pattern mining issues, such as chemistry, Web applications, and other related problems. Top-k subgraph query as an important technology of graph search is widely used in emerging fields. Different from the traditional subgraph query, the q...

Full description

Bibliographic Details
Main Authors: Xiaohuan Shan, Guangxiang Wang, Linlin Ding, Baoyan Song, Yan Xu
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Large-scale dynamic graph
label constraint
aggregation partition
incremental update
Top-<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic> query
Online Access:https://ieeexplore.ieee.org/document/8573576/

Internet

https://ieeexplore.ieee.org/document/8573576/

Similar Items