On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

We discuss the parametrized complexity of counting and evaluation problems on graphs where the range of counting is definable in monadic second-order logic (MSOL). We show that for bounded tree-width these problems are solvable in polynomial time. The same holds for bounded clique width in the cases...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 108; no. 1; pp. 23 - 52
Main Authors:	Courcelle, B., Makowsky, J.A., Rotics, U.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.02.2001
Subjects:	Combinatorial enumeration Fixed parameter complexity Combinatorial enumeration Fixed parameter complexity
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!