Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the concept of data deduplication for redundant graph structures files in this 53-minute lecture by Olgica Milenkovic from the University of Illinois at Urbana-Champaign. Delve into the investigation of robust and minimum fragmentation issues for data files represented by sparse graphs. Discover the connections between deduplication and classical combinatorial problems with wide-ranging applications. Gain insights into application-driven coding theory and its relevance to data management in graph structures.
