On the Parameterized Complexity of Multiple-Interval Graph Problems - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2009

On the Parameterized Complexity of Multiple-Interval Graph Problems

Danny Hermelin
  • Function : Author
Mike Fellows
  • Function : Author
Frances Rosamond
Not file

Dates and versions

hal-00619739 , version 1 (06-09-2011)

Identifiers

  • HAL Id : hal-00619739 , version 1

Cite

Danny Hermelin, Mike Fellows, Frances Rosamond, Stéphane Vialette. On the Parameterized Complexity of Multiple-Interval Graph Problems. Theoretical Computer Science, 2009, 410 (1), pp.53-61. ⟨hal-00619739⟩
90 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More