Titlebook: ;

創(chuàng)新

Coloringadjacent vertices have the same color in vertex coloring. Edge coloring is the process of assigning colors to the edges of a graph such that no two edges incident to the same vertex are assigned the same color. We review sequential, parallel, and distributed algorithms for vertex and edge coloring in this chapter.

FLINT

Complex Networksrks are large and special methods are commonly needed for the analysis of these networks. The main complex networks which are biological networks, social networks, technological networks and information networks are reviewed with brief description of the algorithms needed to solve some problems in these networks in this chapter.

BOOR

Adj異類的