NLC2-decomposition in polynomial time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1665, Issue , 1999, Pages 110-121

  Johansson, Öjvind ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; GRAPH STRUCTURES; POLYNOMIAL APPROXIMATION;

ARBITRARY GRAPHS; CLIQUE-DECOMPOSITION; CLIQUE-WIDTH; GRAPH PROBLEMS; INPUT GRAPHS; POLYNOMIAL-TIME; SINGLE VERTEX; VERTEX-LABELED GRAPHS;

GRAPH THEORY;

EID: 84947714284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46784-x_12     Document Type: Conference Paper

References (15)

1. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, 1990. 119
2. D. G. Corneil, H. Lerchs, and L. Stewart Burlingham. Complement reducible graphs. Discrete Applied Mathematics, 3:163-174, 1981. 110, 111
3. D. G. Corneil, Y. Perl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14:926-934, 1985. 111
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 Applied Mathematics. 111, 111
5. B. Courcelle, J. A. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique width. In Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG’98, volume 1517 of Lecture Notes in Computer Science pages 1-16. Springer, 1998. 111
6. Bruno Courcelle and Stephan Olariu. Clique-width: A graph complexity measure— preliminary results and open problems. In Proceedings of the Fifth International Workshop on Graph Grammars and Their Application to Computer Science, 1994. 110, 112
7. A. Ehrenfeucht and G. Rozenberg. Theory of 2-structures, part i: Clans, basic subclasses, and morphisms. Theoretical Computer Science, 70:277-303, 1990. 115
8. A. Ehrenfeucht and G. Rozenberg. Theory of 2-structures, part ii: Representation through labeled tree families. Theoretical Computer Science, 70:305-342, 1990. 115
9. Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, and Stephen J. Sullivan. An O(n2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs. Journal of Algorithms, 16:283-294, 1994.
10. Ojvind Johansson. Clique-decomposition, NLC-decomposition, and modular decomposition — relationships and results for random graphs. Congressus Numer-antium, 132:39-60, 1998. 111, 114, 114
11. J. A. Makowsky and U. Rotics. On the clique-width of graphs with few P4’s. To appear in IJFCS. 111
12. R. M. McConnell. An O(n2) incremental algorithm for modular decomposition of graphs and 2-structures. Algorithmica, 14:229-248, 1995. 115
13. R. H. Mohring. Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Annals of Operations Research, 4:195-225, 1985/6. 114
14. R. H. Moohring and F. J. Radermacher. Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics, 19:257-356, 1984.
15. Egon Wanke. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics, 54:251-266, 1994. 110, 111, 112, 113, 113