Polynomial time recognition of clique-width ≤ 3 graphs

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

Volumn 1776 LNCS, Issue , 2000, Pages 126-134

  Corneil, Derek G ^a   Habib, Michel ^b   Lanlignel, Jean Marc ^b   Reed, Bruce ^b   Rotics, Udi ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLIQUE-WIDTH; EVALUATION PROBLEMS; GRAPH STRUCTURES; MONADIC SECOND-ORDER LOGIC; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; TREE-WIDTH;

FORESTRY; GRAPHIC METHODS; INFORMATION SCIENCE; OPTIMIZATION; POLYNOMIAL APPROXIMATION; ALGORITHMS; FORMAL LOGIC; POLYNOMIALS; TREES (MATHEMATICS);

TREES (MATHEMATICS); GRAPH THEORY;

EID: 84896754098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10719839_14     Document Type: Conference Paper

References (11)

1. B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. J. Comput. System Sci., 46:218-270, 1993.
2. A. Cournier and M. Habib. A new linear algorithm for modular decomposition. Lecture Notes in Computer Science, 787:68-84, 1994.
3. B. Courcelle, J.A. Makowsky, and U. Rotics. Linear time solvable optimization problems on certain structured graph families, extended abstract. Graph Theoretic Concepts in Computer Science, 24th International Workshop, WG'98, Volume 1517 of Lecture Notes in Computer Science, pages 1-16. Springer Verlang, 1998. Full paper to appear in Theory of Computing Systems.
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 Disc. Appl. Math.
5. B. Courcelle and S. Olariu. Upper bounds to the clique-width of graphs. To appear in Disc. Appl. Math. (http://dept-info.labri.u-bordeaux.fr/~courcell/ ActSci.html), 1999.
6. W.H. Cunningham. Decomposition of directed graphs. SIAM J. Algebraic Discrete Methods, 3:214-228, 1982.
7. M. C. Golumbic and U. Rotics. On the clique-width of perfect graph classes (extended abstract). To appear in WG99, 1999.
8. M. Habib, C. Paul and L. Viennot. Partition refinement techniques: an interesting algorithmic tool kit. International Journal of Foundations of Computer Science, Volume 10, 1999, 2:147-170.
9. 4's. To appear in the International Journal of Foundations of Computer Science (IJFCS), 1999.
10. 2) algorithm for undirected split decomposition. Journal of Algorithms, 16:145-160, 1994.
11. A complete description of the 2-LAB procedure, and also a complete description in French of a different approach to the entire algorithm. http://www.lirmm.fr/~lanligne