"On the complexity of some colorful problems parameterized by treewidth."

Michael R. Fellows et al. (2011)

> Home

Details and statistics

DOI: 10.1016/J.IC.2010.11.026

access: open

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/FellowsFLRSST11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/FellowsFLRSST11
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen:
On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2): 143-153 (2011)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.