A characterisation of clique-width through nested partitions
暂无分享,去创建一个
Bruno Courcelle | Udi Rotics | Pinar Heggernes | Charis Papadopoulos | Daniel Meister | B. Courcelle | P. Heggernes | D. Meister | Charis Papadopoulos | Udi Rotics
[1] Bruno Courcelle,et al. Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..
[2] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[3] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[4] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.
[5] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[6] Paul D. Seymour,et al. Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.
[7] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[8] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[9] Frank Gurski,et al. Linear layouts measuring neighbourhoods in graphs , 2006, Discret. Math..
[10] Dieter Rautenbach,et al. The relative clique-width of a graph , 2007, J. Comb. Theory, Ser. B.
[11] Udi Rotics,et al. Clique-Width is NP-Complete , 2009, SIAM J. Discret. Math..
[12] Bruno Courcelle,et al. Graph operations characterizing rank-width , 2009, Discret. Appl. Math..
[13] Michel Habib,et al. A survey of the algorithmic aspects of modular decomposition , 2009, Comput. Sci. Rev..
[14] Ruth Urner,et al. On a disparity between relative cliquewidth and relative NLC-width , 2010, Discret. Appl. Math..
[15] Udi Rotics,et al. Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width , 2011, CSR.
[16] Pinar Heggernes,et al. Graphs of linear clique-width at most 3 , 2011, Theor. Comput. Sci..
[17] Bruno Courcelle,et al. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.
[18] J. Engelfriet,et al. Graph Structure and Monadic Second-Order Logic: Monadic second-order logic , 2012 .
[19] Bruno Courcelle,et al. Automata for the verification of monadic second-order graph properties , 2012, J. Appl. Log..
[20] Pinar Heggernes,et al. Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs , 2012, Discret. Appl. Math..
[21] A SAT Approach to Clique-Width , 2013, SAT.
[22] Bruno Courcelle. Clique-width and edge contraction , 2014, Inf. Process. Lett..