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

Bruno Courcelle, Johann A. Makowsky, Udi Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics, 108(1-2):23-52, 2001.

Authors

Bruno Courcelle

This author has not been identified. Look up 'Bruno Courcelle' in Google

Johann A. Makowsky

This author has not been identified. Look up 'Johann A. Makowsky' in Google

Udi Rotics

This author has not been identified. Look up 'Udi Rotics' in Google