StarZIP: Streaming Graph Compression Technique for Data Archiving
The size of a streaming graph is possibly unbounded, and it is updated by a continuous sequence of edges over time. Due to numerous types of real-world interactions, the nature of edge arrival in a streaming graph is dynamic and holds different types of temporal subgraphs, such as stars, bipartite f...
Main Authors: | Batjargal Dolgorsuren, Kifayat Ullah Khan, Mostofa Kamal Rasel, Young-Koo Lee |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8649624/ |
Similar Items
-
On-the-Fly Output Compression for Join-Based Graph Mining Algorithms
by: Mostofa Kamal Rasel, et al.
Published: (2018-01-01) -
GraphZIP: a clique-based sparse graph compression method
by: Ryan A. Rossi, et al.
Published: (2018-03-01) -
Dichotomy Graph Sketch: Summarizing Graph Streams with High Accuracy Based on Deep Learning
by: Ding Li, et al.
Published: (2023-12-01) -
A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle
by: V. J. Vernold, et al.
Published: (2012-03-01) -
A characterization of star-perfect graphs
by: G Ravindra, et al.
Published: (2024-03-01)