Short Talks by Postdoctoral Members

We present a novel way of sparsifying a piece of a graph with very few edges. Our results imply the existence of optimal ultrasparsifiers and efficient approximation algorithms with good approximation guarantee for maximizing the algebraic connectivity of a graph with few edges.