Parameterized Graph Algorithms

← Back to Domain-Specific Abstractions by Domain

1 domain-specific abstractions whose origin domain is Parameterized Graph Algorithms.

• Bidimensionality — A graph-algorithm framework for parameters that grow quadratically on grid-like graphs and do not increase under minors or contractions, enabling subexponential and kernel results.