Open AccessLower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
Author(s) -
Ivan Bliznets,
Marek Cygan,
Paweł Komosa,
Lukáš Mach,
Michał Pilipczuk
Publication year - 2015
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1137/1.9781611974331.ch79
Subject(s) - interval graph , parameterized complexity , exponential time hypothesis , chordal graph , mathematics , interval (graph theory) , combinatorics , discrete mathematics , graph , time complexity , exponential function , treewidth , pathwidth , line graph , 1 planar graph , mathematical analysis
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom