Graph Compression by BFS
نویسندگان
چکیده
منابع مشابه
Graph Compression by BFS
The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general ...
متن کاملGraph Compression
Graphs form the foundation of many real-world datasets. At the same time, the size of graphs presents a big obstacle to understand the essential information they contain. In this report, I mainly review the framework in article [1] for compressing large graphs. It can be used to improve visualization, to understand the high-level structure of the graph, or as a pre-processing step for other dat...
متن کاملGraph compression—save information by exploiting redundancy
In this paper we raise the question of how to compress sparse graphs. By introducing the idea of redundancy, we find a way to measure the overlap of neighbors between nodes in networks. We exploit symmetry and information by making use of the overlap in neighbors and analyzing how information is reduced by shrinking the network and, using the specific data structure we created, we generalize th...
متن کاملGrammar-Based Graph Compression
We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other approaches. Specific queries such as reachability between two nodes or regular path queries can be evaluated in linear time (or quadratic times, respectively),...
متن کاملK-plet and Coupled BFS: A Graph Based Fingerprint Representation and Matching Algorithm
In this paper, we present a new fingerprint matching algorithm based on graph matching principles. We define a new representation called K-plet to encode the local neighborhood of each minutiae. We also present CBFS (Coupled BFS), a new dual graph traversal algorithm for consolidating all the local neighborhood matches and analyze its computational complexity. The unique advantages of the propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2009
ISSN: 1999-4893
DOI: 10.3390/a2031031