Titlebook: ;

BAIT

On the Relationship between Clique-Width and Treewidth,t shares one of the powerful properties of treewidth, namely: if a graph is of bounded treewidth (or clique-width), then there is a polynomial time algorithm for any graph problem expressible in Monadic Second Order Logic, using quantifiers on vertices (in the case of clique-width you must assume a

到婚嫁年齡

暫時(shí)別動(dòng)

incredulity

被詛咒的人

On Star Coloring of Graphs,rs are assigned the same color) such that any path of length 3 in . is not bicolored..We give the exact value of the star chromatic number of different families of graphs such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional grids. We also study and give bounds for t

得意人

陶器

Approximation of Pathwidth of Outerplanar Graphs,In this paper, we give an algorithm, that given a biconnected outerplanar graph ., finds a path decomposition of . of pathwidth at most twice the pathwidth of . plus one. To obtain the result, several relations between the pathwidth of a biconnected outerplanar graph and its dual are established.

沉積物

On the Monotonicity of Games Generated by Symmetric Submodular Functions,game theoretic framework able to unify old and new monotonicity results in a unique min-max theorem. Our theorem, provides a game theoretic analogue to a wide number of graph theoretic parameters such as linear-width and cutwidth.

和平主義

Multiple Hotlink Assignment, the weighted shortest path length rooted at . by adding a restricted number of outgoing arcs (.) to each node. The (.)-hotlink assignment problem is defined on .-regular complete trees, and at most . hotlinks can be assigned to each node.We contribute algorithms for the (1, .), (2, .), and (.-1, .)

AVERT