Optimal Representation of Large-Scale Graph Data Based on Grid Clustering and K2-Tree
The application of appropriate graph data compression technology to store and manipulate graph data with tens of thousands of nodes and edges is a prerequisite for analyzing large-scale graph data. The traditional K2-tree representation scheme mechanically partitions the adjacency matrix, which caus...
Main Authors: | Fengying Li, Enyi Yang, Anqiao Ma, Rongsheng Dong |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2020/2354875 |
Similar Items
-
Optimal Representation for Web and Social Network Graphs Based on <inline-formula> <tex-math notation="LaTeX">${K}^{2}$ </tex-math></inline-formula>-Tree
by: Fengying Li, et al.
Published: (2019-01-01) -
Clustering algorithms for large scale graph data
by: McConville, Ryan
Published: (2017) -
Optimal Planning of Grid Scale PHES Through Characteristics-Based Large Scale Data Clustering and Emission Constrained Optimization
by: Abebe Tilahun Tadie, et al.
Published: (2019-06-01) -
An Optimized Representation for Dynamic k-ary Cardinal Trees
by: Yasam, Venkata Sudheer Kumar Reddy
Published: (2009) -
Implementation, performance analysis and optimization of a molecular dynamics tree algorithm for large-scale cluster systems
by: Naim, MD
Published: (2012)