Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 What Is a Kernel?
- Part I Upper Bounds
- 2 Warm Up
- 3 Inductive Priorities
- 4 Crown Decomposition
- 5 Expansion Lemma
- 6 Linear Programming
- 7 Hypertrees
- 8 Sunflower Lemma
- 9 Modules
- 10 Matroids
- 11 Representative Families
- 12 Greedy Packing
- 13 Euler–s Formula
- Part II Meta Theorems
- Part III Lower Bounds
- Part IV Beyond Kernelization
- Appendix A Open Problems
- Appendix B Graphs and SAT Notation
- Appendix C Problem Definitions
- References
- Author Index
- Index
9 - Modules
from Part I - Upper Bounds
Published online by Cambridge University Press: 03 January 2019
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 What Is a Kernel?
- Part I Upper Bounds
- 2 Warm Up
- 3 Inductive Priorities
- 4 Crown Decomposition
- 5 Expansion Lemma
- 6 Linear Programming
- 7 Hypertrees
- 8 Sunflower Lemma
- 9 Modules
- 10 Matroids
- 11 Representative Families
- 12 Greedy Packing
- 13 Euler–s Formula
- Part II Meta Theorems
- Part III Lower Bounds
- Part IV Beyond Kernelization
- Appendix A Open Problems
- Appendix B Graphs and SAT Notation
- Appendix C Problem Definitions
- References
- Author Index
- Index
- Type
- Chapter
- Information
- KernelizationTheory of Parameterized Preprocessing, pp. 133 - 163Publisher: Cambridge University PressPrint publication year: 2019