How to Use
Select graph:
- mw: Modular-width
- Tree: Decomposition
- Prime: Max children
Modules
Module M ⊆ V: for every v ∉ M, v is adjacent to all of M or none. Trivial modules: ∅, V, singletons. Modular decomposition: unique tree of modules. Node types: series (join), parallel (union), prime (neither).
Algorithmic Use
Many problems (independent set, coloring, domination) solvable FPT by mw: solve on prime nodes (small), combine along tree. Modular decomposition computable in O(n+m). Very practical parameter.
Step-by-Step Instructions
- 1Select graph.
- 2Build mod. decomp.
- 3Find prime nodes.
- 4Compute max children.
- 5Apply FPT.