Abstract

We investigate the issues of robust and minimum fragmentation for data files captured by sparse graphs. In the process, we establish numerous connections between deduplication and classical combinatorial problems of broad applicability.

Video Recording