Titlebook: Distributed Graph Coloring; Fundamentals and Rec Leonid Barenboim,Michael Elkin Book 2013 Springer Nature Switzerland AG 2013

附錄

https://doi.org/10.1057/9780230252967 achieve a unified legal coloring of the entire input graph is more complicated. In this chapter we describe an algorithm that computes a forest–decomposition for graphs with bounded arboricity (see Section 2.3 for the definition of arboricity), and uses it for coloring them efficiently. The materia

Blazon

Forest-Decomposition Algorithms and Applications, achieve a unified legal coloring of the entire input graph is more complicated. In this chapter we describe an algorithm that computes a forest–decomposition for graphs with bounded arboricity (see Section 2.3 for the definition of arboricity), and uses it for coloring them efficiently. The materia

陳舊

噴出

978-3-031-00881-8Springer Nature Switzerland AG 2013

saturated-fat

https://doi.org/10.1057/9780230252967In this chapter we provide the background in Graph Leory which is most relevant to this monograph. We make no attempt to survey this entire area. Many books are devoted to this subject. See, e.g., [13, 23]

銼屑

IRS

河流

https://doi.org/10.1057/9780230252967In this section we discuss computation of defective colorings (see also Section 2.4), and show how defective colorings can be transformed into legal ones. Specifically, we describe a (? + 1)–coloring algorithm that requires .(?)+ log. . time, which is based on defective coloring. The results of this section are due to [8, 48].

Prognosis

https://doi.org/10.1057/9780230252967In this chapter we describe an important general technique for solving distributed symmetry breaking problems, called the . Algorithms that are based on this technique consist of two stages. In the first stage a . is constructed, and in the second stage this decomposition is used to solve a problem at hand.

regale

Basics of Graph Theory,In this chapter we provide the background in Graph Leory which is most relevant to this monograph. We make no attempt to survey this entire area. Many books are devoted to this subject. See, e.g., [13, 23]