Searching for "On the Complexity of Some Colorful Problems Parameterized by Treewidth." – 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 Complexity of Some Colorful Problems Parameterized by Treewidth ⋆
by Michael Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
…On the Complexity of Some Colorful Problems Parameterized by Treewidth ⋆ Michael Fellows 1 , Fedor…
Cited by 3 (3 self) – Add To MetaCart

Showing 1 through 1.

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