Exercise 1: It’s a Colorful Life Task 1: How the Colors Get into the Trees 1. Change the Cole-Vishkin algorithm from the lecture so that it requires only 1 2 · log∗ n O(1) rounds. The result should still be a mess - Maximal independent set - Document - PDFSEARCH.IO

First Page	Meta Content
	Exercise 1: It’s a Colorful Life Task 1: How the Colors Get into the Trees 1. Change the Cole-Vishkin algorithm from the lecture so that it requires only 1/2 · log∗ n + O(1) rounds. The result should still be a mess Add to Reading List Document Date: 2014-10-28 15:42:58 Open Document File Size: 79,93 KB Share Result on Facebook

Exercise 1: It’s a Colorful Life Task 1: How the Colors Get into the Trees 1. Change the Cole-Vishkin algorithm from the lecture so that it requires only 1/2 · log∗ n + O(1) rounds. The result should still be a messAdd to Reading List