Komprese grafů

Abstract

The thesis deals with compression of vast graphs in an effort to preserve possibility of reverse decompression of required part without necessity of decompression the whole graph. In the first part of this thesis the theory of this issue is summarized including description of several selected algorithms solving graph compression problem. The second part of this thesis is focused on practical problems of graph compression including implementation of selected algorithm with respect to effectivity of implementation. Conclusion of this thesis contains evaluation of implementation of selected algortihm by application of this algorithm to several selected graphs.