Pool Compression for Undirected Graphs-Reference-Cited by-同舟云学术

Pool Compression for Undirected Graphs

Author:

Yousuf Muhammad Irfan¹,Kim Suhyun²^ORCID

Affiliation:

1. Department of Computer Science, University of Engineering and Technology (New Campus), Lahore, Pakistan

2. Center for Artificial Intelligence, Korea Institute of Science and Technology, Seoul, Republic of Korea

Funder

National Research Council of Science & Technology (NST) Grant by the Korea Government [Ministry of Science and ICT (MSIT)]

Institute of Information & Communications Technology Planning & Evaluation (IITP) Grant

Korea Government (MSIT)

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

General Engineering,General Materials Science,General Computer Science,Electrical and Electronic Engineering

Link

Reference33 articles.

1. Compact representations of separable graphs;blandford;Proc 14th Annu ACM-SIAM Symp Discrete Algorithms,2003

3. Web-graph pre-compression for similarity based algorithms;khalili;Proc 3rd Int Conf Modeling Simulation Appl Optim,2009

4. Survey and taxonomy of lossless graph compression and space-efficient graph representations;besta;arXiv 1806 01799,2018

5. The network data repository with interactive graph analytics and visualization;rossi;Proc 29th AAAI Conf Artif Intell,2015

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A $k-\text{Way}$ Partitioning Framework for Compression on Social Networks;2022 International Conference on Computational Science and Computational Intelligence (CSCI);2022-12