Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive “power” from… (More)

Given a positive integer p, a graph G and a pair of two terminals s and t in G, the minimum sharededge paths problem is to find p paths connecting s and t so as to minimize the number of edges shared… (More)

A total coloring of a graphG is a coloring of all elements of G, i.e., vertices and edges, in su a way that no two adjacent or incident elements receive the same color. Let L(x) be a set of colors… (More)

Haze or fog is a common natural phenomenon. In foggy weather, the captured pictures are difficult to be applied to computer vision system, such as road traffic detection, target tracking, etc.… (More)

A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths with the same wavelength… (More)

Ž Many combinatorial problems can be efficiently solved for partial k-trees graphs . of treewidth bounded by k . The edge-coloring problem is one of the well-known combinatorial problems for which no… (More)

For a graph G=(V,E) and a color set C, let f:E→C be an edge-coloring of G in which two adjacent edges may have the same color. Then, the graph G edge-colored by f is rainbow connected if every two… (More)