Meanings
- uncountablemathematicsThe condition of being kernelizable
In this way, we obtain fixed-parameter tractability and polynomial kernelizability results, with the central parameter being the maximum vertex degree.
2016, Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier, “A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems”, in arXiv
Cite this entry
kernelizability. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/kernelizability
“kernelizability.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/kernelizability. Accessed November 4, 2026.
WatkinsX Dictionary, s.v. “kernelizability,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/kernelizability.
Source: kernelizability on Wiktionary, CC BY-SA 4.0.