• Keine Ergebnisse gefunden

Homework Sheet 2: Low Diameter Decomposition

N/A
N/A
Protected

Academic year: 2021

Aktie "Homework Sheet 2: Low Diameter Decomposition"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Homework Sheet 2: Low Diameter Decomposition

Due Date: 03-05-2019

Sequential Algorithms

1. Given a graph G with a partial ∆ + 1 coloring of it, i.e. only some of its vertices are colored (properly, i.e. no edge has both endpoints of same color). Show that it is always possible to extend this partial coloring to a proper ∆ + 1 coloring of G.

2. a. Provide two classes of graphs which they do not admit ∆ coloring.

b. (Bonus Exercise) Show that deciding whether a graph can be colored by ∆ colors is polynomial time solvable.

3. Suppose Minimum Dominating Set has no o(log n)-approximation un- less P = N P . Then show that unless P = N P , there is no polyno- mial time o(log n)-approximation of minimum dominating set problem in graphs of diameter ≤ 4. Is it possible to show the same for diame- ter 3? What about diameter 2?

4. Suppose G is a graph, and X is a subset of vertices. Then, S ⊂ V (G) is a Minimum X-Dominating Set, if it is a minimum sized set such that for any v ∈ X, either x ∈ S or x ∈ N (u) for some u ∈ S.

Suppose X

1

and X

2

are two vertex subsets, and let S

i

be a minimum- X

i

-dominating set for i ∈ {1, 2}. Then show that if N (X

1

) ∩ N (X

2

) =

∅, then S

1

∪ S

2

is a minimum X

1

∪ X

2

-dominating set. Here N (X) = {v | v ∈ X or ∃u ∈ X, v ∈ N (u)}.

1

(2)

Distributed Algorithms

5. An edge coloring of a graph G is to color its edges so that no two edges that intersect on the same endpoint have the same color. Let suppose a graph G with maximum degree ∆ and its (c, D)-network decomposition are given. Provide an algorithm to calculate O(∆

2

) edge coloring of G in O(c·D) communication rounds. Can you improve the number of colors without exploring the entire graph? (In the sequential settings by Vizing’s theorem we know that every graph has

∆ + 1 edge coloring).

6. A Maximal Independent Set (MIS) problem asks for finding a set of vertices M ⊆ V (G) such that no two of them are neighbors of each other and in addition to that every vertex u ∈ V (G) − M is a neighbor of a node in M . Suppose a (c, D)-network decomposition of a graph G is given. Let ∆ be a maximum degree of G. Find a MIS of G in O(c · D + ∆).

7. Suppose we have a Weak-(c, D)-Decomposition of a graph G. Then show that there is a LOCAL distributed algorithm for computing a

∆ + 1 coloring of G in O(cD) rounds.

8. Let P be a path of length `. Show that P can be properly colored using 2-colors. Show that any distributed algorithm for coloring P with 2 colors needs more than `/10 rounds.

2

Referenzen

ÄHNLICHE DOKUMENTE

Use also the facts that R with the usual topology is second countable and that every family of pairwise disjoint nonempty open sets must be countable.)7. Let (X, τ ) be the

The so-called stability criterion (or Courant criterion) is const=c dt/dx where c is the maximum velocity and const=1. You want to simulate 500s. Determine dt and the number

b) Modify the game arena such that it becomes deadlock free such that the correctness of the tree acceptance game (Lemma 8.13 in the lecture notes) is preserved.. c) How can one

We want to discuss the origin of the BRST symmetry in a more general context, and show that, by quoting Zinn-Justin, the ”Slavnov Taylor identities in gauge theories owe less to

der Universit at M unchen Set

To prove this, it can be helpful to observe that a random graph in K results by tossing a fair coin for every possible edge pair {i, j}, {−i, −j}. Put everything together to prove

In this exercise we want to show that the model construction for FO 2 -formulae from the lecture is optimal in the following sense: in general it does not suffice to take only