Titlebook: ;

plasma

Generalized coloring for tree-like graphs,artial k-trees are solved in linear time, when the number of colors is a constant and by O(|V|.)-algorithmsin general. For trees, we improve this to linear time. In contrast to that, . and . differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. W

amphibian

兵團

,Kayles on special classes of graphs — An application of Sprague-Grundy theory,iven graph. The last player that choses a vertex wins the game. We show, with help of Sprague-Grundy theory, that the problem to determine which player has a winning strategy for a given graph, can be solved in O(n. time on interval graphs, on circular arc graphs, on permutation graphs, and on co-co

GNAT

逢迎春日

Improved algorithms for routing on two-dimensional grids,e wires. We pay particular attention to routing problems where each wire connects terminals that are distance at most . apart in the grid and where each wire is allowed to have at most . bends. (Typically, . and . are small constants, but they can also represent arbitrary functions of .). Among othe

Adj異類的

侵蝕

暖昧關(guān)系

Osmosis

On the homogeneous decomposition of graphs,ry graphs: the leaves of this tree are the p-connected components along with weak vertices, that is, vertices of the graph that belong to no p-connected component. By refining this first result, we obtain a new decomposition for arbitrary graphs that generalizes the well-known modular decomposition.

外向者