Assertion: graph | /r/HasProperty | multiplied by larger function of k.
Facets:
Source sentences:
text: The problem is fixed-parameter tractable, meaning that there is an algorithm whose running time can be bounded by a polynomial function of the size of the graph multiplied by a larger function of k.