Searching for "On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order
by B. Courcelle , J. A. Makowsky , U. Rotics — 2001
… problems de nable in monadic second-order logic Abstract B. Courcelle a;1 , J.A. Makowsky b;∗;2 , U. Rotics…
Cited by 34 (16 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB