On the Complexity of Some Colorful Problems Parameterized by Treewidth
暂无分享,去创建一个
Michael R. Fellows | Fedor V. Fomin | Saket Saurabh | Stefan Szeider | Carsten Thomassen | Daniel Lokshtanov | Frances A. Rosamond | C. Thomassen | M. Fellows | F. Fomin | Stefan Szeider | Saket Saurabh | D. Lokshtanov
[1] D. Marx. Graph coloring with local and global constraints , 2004 .
[2] Alexandr V. Kostochka,et al. A list analogue of equitable coloring , 2003, J. Graph Theory.
[3] Hans L. Bodlaender,et al. A Tourist Guide through Treewidth , 1993, Acta Cybern..
[4] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[5] Saket Saurabh,et al. Capacitated Domination and Covering: A Parameterized Perspective , 2008, IWPEC.
[6] Paulo S. C. Alencar,et al. Software Engineering for Multi-Agent Systems II , 2004 .
[7] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[8] Craig A. Tovey,et al. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families , 1992, Algorithmica.
[9] P. Lax. Proof of a conjecture of P. Erdös on the derivative of a polynomial , 1944 .
[10] Douglas R. Woodall,et al. List colourings of graphs , 2001 .
[11] Zsolt Tuza,et al. New trends in the theory of graph colorings: Choosability and list coloring , 1997, Contemporary Trends in Discrete Mathematics.
[12] Fedor V. Fomin,et al. Equitable Colorings of Bounded Treewidth Graphs , 2004, MFCS.
[13] Zsolt Tuza,et al. Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.
[14] Michael R. Fellows,et al. Quadratic Kernelization for Convex Recoloring of Trees , 2007, Algorithmica.
[15] Dimitrios M. Thilikos,et al. Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..
[16] Shai Gutner,et al. Some results on (a: b)-choosability , 2008, Discret. Math..
[17] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[18] Béla Bollobás,et al. List-colourings of graphs , 1985, Graphs Comb..
[19] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..
[20] Michael R. Fellows,et al. On the Fixed-Parameter Intractability and Tractability of Multiple-Interval Graph Problems , 2007 .
[21] B. Bollobás. Surveys in Combinatorics , 1979 .
[22] Klaus Jansen,et al. Generalized Coloring for Tree-like Graphs , 1992, WG.
[23] Marko Samer,et al. Constraint satisfaction with bounded treewidth revisited , 2006, J. Comput. Syst. Sci..
[24] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory, Ser. B.
[25] Michael R. Fellows,et al. Connected Coloring Completion for General Graphs: Algorithms and Complexity , 2007, COCOON.
[26] N. Alon. Restricted colorings of graphs , 1993 .
[27] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.
[28] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.