DeepAI AI Chat
Log In Sign Up

Some General Structure for Extremal Sparsification Problems

by   Greg Bodwin, et al.

This paper is about a branch of theoretical computer science that studies how much graphs can be sparsified while faithfully preserving their properties. Examples include spanners, distance preservers, reachability preservers, etc. We introduce an abstraction that captures all of the above, and then we prove a couple simple structural lemmas about this abstraction. These imply unified proofs of some state-of-the-art results in the area, and they improve the size of Chechik's +4 additive spanner [SODA '13] from O(n^7/5) to O(n^7/5).


page 1

page 2

page 3

page 4


Leveraging polyhedral reductions for solving Petri net reachability problems

We propose a new method that takes advantage of structural reductions to...

A Theoretical Computer Science Perspective on Free Will

We consider the paradoxical concept of free will from the perspective of...

A Critique of Sopin's "PH = PSPACE"

We critique Valerii Sopin's paper "PH = PSPACE" [Sop14]. The paper clai...

Visual Abstraction

In this article we revisit the concept of abstraction as it is used in v...

22 Examples of Solution Compression via Derandomization

We provide bounds on the compression size of the solutions to 22 problem...

Dynamic IFC Theorems for Free!

We show that noninterference and transparency, the key soundness theorem...

Visibility Reasoning for Concurrent Snapshot Algorithms

Visibility relations have been proposed by Henzinger et al. as an abstra...