NLC2-decomposition in polynomial time

International Journal of Foundations of Computer Science

Volumn 11, Issue 3, 2000, Pages 373-395

  Johansson, Öjvind ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

clique width; cograph; Graph algebra; graph decomposition; NLC width

Indexed keywords

EID: 27844576086     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054100000223     Document Type: Article

References (15)

1. T. H. Gormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, 1990).
2. D. G. Corneil, H. Lerchs and L. S. Burlingham, "Complement reducible graphs," Discrete Appl Math. 3 (1981) 163-174.
3. D. G. Corneil, Y. Perl and L. K. Stewart, "A linear recognition algorithm for cographs," SIAM J. Comput. 14 (1985) 926-934.
4. B. Courcelle, J. A. Makowsky and U. Rotics, "On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic." To appear in Discrete Appl. Math.
5. B. Courcelle, J. A. Makowsky and U. Rotics, "Linear time solvable optimization problems on graphs of bounded clique width," in Proc. 24th Int. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1517 (Springer, Berlin, 1998) pp. 1-16.
6. B. Courcelle and S. Olariu, "Clique-width: A graph complexity measure-preliminary results and open problems," in Proc. 5th Int. Workshop on Graph Grammars and Their Application to Computer Science, Williamsburg, VA, November 1994, pp. 263-270.
7. A. Ehrenfeucht, H. N. Gabow, R. M. McConnell and S. J. Sullivan, "An 0(n2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs," J. Algorithms 16 (1994) 283-294.
8. A. Ehrenfeucht and G. Rozenberg, "Theory of 2-structures, part I: Clans, basic subclasses, and morphisms," Theoret. Comput. Sci. 70 (1990) 277-303.
9. A. Ehrenfeucht and G. Rozenberg, "Theory of 2-structures, part II: Representation through labeled tree families," Theoret. Comput. Sci. 70 (1990) 305-342.
10. O. Johansson, "CHque-decomposition, NLC-decomposition, and modular decomposition -relationships and results for random graphs," Conor. Numer. 132 (1998) 39-60.
11. J. A. Makowsky and U. Rotics, "On the clique-width of graphs with few P4ss." To appear in Internat. J. Found. Comput. Sci.
12. R. M. McConnell, "An 0(n2) incremental algorithm for modular decomposition of graphs and 2-structures," Algorithmica 14 (1995) 229-248.
13. R. H. Mohring, "Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions," Ann. Oper. Res. 4 (1985/6) 195-225.
14. R. H. Mohring and F. J. Radermacher, "Substitution decomposition for discrete structures and connections with combinatorial optimization," Ann. Discrete Math. 19 (1984) 257-356.
15. E. Wanke, "fc-NLC graphs and polynomial algorithms," Discrete Appl. Math. 54 (1994) 251-266.