The Community for Technology Leaders
2015 3rd International Conference on Future Internet of Things and Cloud (FiCloud) (2015)
Rome, Italy
Aug. 24, 2015 to Aug. 26, 2015
ISBN: 978-1-4673-8102-4
pp: 427-434
ABSTRACT
A graph is used to represent data in which the relationships between the objects in the data are at least as important as the objects themselves. Large graph datasets are becoming more common as networks such as the Internet grow, and our ability to measure these graphs improves. This necessitates methods to compress these datasets. In this paper we present a method aimed at lossy compression of large, dynamic, weighted graphs.
INDEX TERMS
Approximation methods, Approximation algorithms, Weight measurement, Heuristic algorithms, Social network services, Noise
CITATION

W. Henecka and M. Roughan, "Lossy Compression of Dynamic, Weighted Graphs," 2015 3rd International Conference on Future Internet of Things and Cloud (FiCloud)(FICLOUD), Rome, Italy, 2015, pp. 427-434.
doi:10.1109/FiCloud.2015.64
86 ms
(Ver 3.3 (11022016))