Efficient Computation of a Near-Maximum Independent Set over Evolving GraphsDate: April 01, 2018Share on Twitter Facebook LinkedIn Previous Next