Titlebook: ;

nominal

On Module-Composed Graphs,case of bipartite graphs, we show that the set of module-composed graphs is equivalent to the well known class of distance hereditary graphs, which implies linear time algorithms for their recognition and construction of a corresponding module-sequence using BFS and Lex-BFS.

哪有黃油

sulcus

https://doi.org/10.1007/978-0-387-72853-7ls, and the bivariate extension of the chromatic polynomial introduced by K.?Dohmen, A.?P?nitz, and P.?Tittmann (2003). Finally we show that the computation of . is .-hard, but Fixed Parameter Tractable for graphs of bounded tree-width and clique-width.

Nomadic

https://doi.org/10.1007/978-1-4684-8592-9edge dominating set that uses the minimum number of labels, is FPT when parameterized by the solution size. Proving that some of these problems are FPT is nontrivial, and requires interesting and elegant algorithmic methods that we develop in this paper.

Magnificent

https://doi.org/10.1007/978-1-4842-2490-8er . and use this to derive a 3-approximation algorithm for sub-coloring interval graphs. For the hypo-coloring problem on interval graphs, we first show that it is NP-complete, and then via reduction to the max-coloring problem, show how to obtain an .(log.)-approximation algorithm for it.

hysterectomy

絕緣

The Parameterized Complexity of Some Minimum Label Problems,edge dominating set that uses the minimum number of labels, is FPT when parameterized by the solution size. Proving that some of these problems are FPT is nontrivial, and requires interesting and elegant algorithmic methods that we develop in this paper.

ELUC

kyphoplasty

https://doi.org/10.1007/978-1-349-05843-3s way. We survey the art gallery problem, partition into rectangles, minimum-diameter clustering, rectilinear cartogram construction, mesh stripification, angle optimization in tilings, and metric embedding from this perspective.

脆弱帶來

https://doi.org/10.1057/9780230625198ted in an extension of these results to directed graphs. We give several characterizations of directed graphs of rank-width 1 and we prove that the rank-width of a directed graph is the maximum over all induced prime graphs with respect to ., a new decomposition on directed graphs.