332 search results - page 4 / 67 » Parameterized Graph Separation Problems |
CPM
2010
Springer
15 years 2 months ago
2010
Springer
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
CPM
2008
Springer
14 years 11 months ago
2008
Springer
CORR
2010
Springer
14 years 6 months ago
2010
Springer
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...