On the relationship between NLC-width and linear NLC-width
暂无分享,去创建一个
[1] Thomas Lengauer. Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees , 1982 .
[2] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[3] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Öjvind Johansson. NLC2-Decomposition in Polynomial Time , 1999, WG.
[6] Feodor F. Dragan,et al. New Graph Classes of Bounded Clique-Width , 2002, Theory of Computing Systems.
[7] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[8] Dieter Rautenbach,et al. The relative clique-width of a graph , 2007, J. Comb. Theory, Ser. B.
[9] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..
[10] Egon Wanke,et al. How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time , 2001, WG.
[11] Paul D. Seymour,et al. Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.
[12] Egon Wanke,et al. k-NLC Graphs and Polynomial Algorithms , 1994, Discret. Appl. Math..
[13] Udi Rotics,et al. Edge dominating set and colorings on graphs with fixed clique-width , 2003, Discret. Appl. Math..
[14] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[15] Öjvind Johansson,et al. Graph Decomposition Using Node Labels , 2001 .
[16] Udi Rotics,et al. Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract) , 2000, Latin American Symposium on Theoretical Informatics.
[17] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[18] D. Seinsche. On a property of the class of n-colorable graphs , 1974 .
[19] Ioan Todinca. Coloring Powers of Graphs of Bounded Clique-Width , 2003, WG.
[20] Egon Wanke,et al. The Tree-Width of Clique-Width Bounded Graphs Without Kn, n , 2000, WG.
[21] Udi Rotics,et al. On the Clique-Width of Some Perfect Graph Classes , 2000, Int. J. Found. Comput. Sci..