On a disparity between relative cliquewidth and relative NLC-width
暂无分享,去创建一个
[1] Dieter Rautenbach,et al. The relative clique-width of a graph , 2007, J. Comb. Theory, Ser. B.
[2] Bruno Courcelle,et al. Compact Forbidden-Set Routing , 2007, STACS.
[3] B. Reed,et al. Polynomial Time Recognition of Clique-Width ≤ 3 Graphs , 2000 .
[4] Öjvind Johansson. NLC2-Decomposition in Polynomial Time , 1999, WG.
[5] Paul D. Seymour,et al. Approximating clique-width and branch-width , 2006, J. Comb. Theory B.
[6] Udi Rotics,et al. Clique-width minimization is NP-hard , 2006, STOC '06.
[7] Michaël Rao,et al. NLC-2 Graph Recognition and Isomorphism , 2007, WG.
[8] Pinar Heggernes,et al. Graphs of linear clique-width at most 3 , 2011, Theor. Comput. Sci..
[9] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[10] Egon Wanke,et al. k-NLC Graphs and Polynomial Algorithms , 1994, Discret. Appl. Math..
[11] Egon Wanke,et al. Minimizing NLC-Width is NP-Complete , 2005, WG.
[12] Udi Rotics,et al. Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract) , 2000, Latin American Symposium on Theoretical Informatics.
[13] Udi Rotics,et al. On the Clique-Width of Some Perfect Graph Classes , 2000, Int. J. Found. Comput. Sci..
[14] Bruno Courcelle,et al. Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..
[15] Egon Wanke,et al. On the relationship between NLC-width and linear NLC-width , 2005, Theor. Comput. Sci..