Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > PLANAR GRAPH PROBLEMS:
Reports tagged with Planar graph problems:
TR01-023 | 13th March 2001
Jochen Alber, Henning Fernau, Rolf Niedermeier

#### Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

Revisions: 1

A parameterized problem is called fixed parameter tractable
if it admits a solving algorithm whose running time on
input instance $(I,k)$ is $f(k) \cdot |I|^\alpha$, where $f$
is an arbitrary function depending only on~$k$. Typically,
$f$ is some exponential function, e.g., $f(k)=c^k$ for ... more >>>

TR19-039 | 12th March 2019
Eric Allender, Archit Chauhan, Samir Datta, Anish Mukherjee