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.

Version

v2 · 2026-09-19 · History

Domain-specific #

3458

Domain group

Applied Sciences & Engineering

Origin domain

Computer Science & Software Engineering

Subdomain

Parameterized Graph Algorithms → Computer Science & Software Engineering

Core Idea

Bidimensionality theory combines graph-minor structure with a parameter's monotonicity and grid growth to obtain treewidth bounds, approximation schemes, kernels, and fixed-parameter algorithms on sparse graph classes. A large parameter-obstruction grid forces large value; conversely a small parameter excludes large grids and bounds treewidth, after which dynamic programming or decomposition algorithms apply. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The Hidden Checkerboard Trick

Imagine a puzzle drawn on a map of dots and lines. If the map has a big checkerboard pattern hidden inside it, the puzzle's answer has to be big. So if you already know the answer is small, the map can't hide a big checkerboard, which means it's skinny and branchy like a tree. Skinny, branchy maps can be solved quickly piece by piece. Bidimensionality is the idea that uses this trick.

No Big Grid, Easy Puzzle

Bidimensionality is a trick computer scientists use to solve hard problems on certain kinds of networks, like maps that can be drawn flat without lines crossing. It uses a grid pattern — like graph paper — as a test. For some problems, if the network contains a big grid, the answer must be big, growing with the grid's area. Flip that around: if the answer is small, the network can't contain a big grid, and networks without big grids are 'tree-like'. Tree-like networks are much easier to handle, so the problem can be solved quickly. This only works when the problem and network type satisfy certain rules.

Grid-Growth Treewidth Method

Bidimensionality is a theory in parameterized algorithms for graph problems on sparse graph classes, such as planar graphs or graphs excluding a fixed minor. A graph parameter is bidimensional if it doesn't increase when you take minors (or contractions) and if on a k-by-k grid-like graph its value is at least about k² — it grows with the grid's area. Graph-minor theory says that graphs in these classes with no large grid have small treewidth, meaning they are tree-like. So if the parameter is small, the graph can't contain a large grid, which bounds its treewidth, and then dynamic programming over a tree decomposition solves the problem efficiently. This framework gives fixed-parameter algorithms, approximation schemes and kernels, but only when all its conditions are met.

 

Bidimensionality combines graph-minor structure theory with properties of a graph parameter to obtain algorithmic results on sparse graph classes. A parameter is bidimensional if it is minor-monotone (or contraction-monotone, in the contraction variant) and grows quadratically on grid-like graphs, i.e., it is Ω(k²) on the k × k grid or an appropriate grid-like obstruction. In classes such as planar or H-minor-free graphs, excluded-grid theorems say that large treewidth forces a large grid minor (or contraction), which in turn forces a large parameter value. Contrapositively, a parameter value of k bounds treewidth by O(√k), so tree-decomposition dynamic programming yields subexponential fixed-parameter algorithms. The same structure underlies polynomial-time approximation schemes and linear kernels for many such problems. Applying the theory requires verifying all hypotheses: the graph class, the parameterized problem, the relevant monotonicity, the quadratic grid-growth condition, and the specific meta-theorem's extra conditions; resembling a sparse-graph algorithm is not enough.

Scope of Application

Bidimensionality belongs to parameterized graph algorithms and is useful where the analyst can specify the typed parameterized graph algorithms carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the graph class, parameterized problem, minor- or contraction-monotonicity, quadratic grid-growth condition, and algorithmic meta-theorem hypotheses are all satisfied. The scope is broad within that domain but bounded by the need for the graph class, parameterized problem, minor- or contraction-monotonicity, quadratic grid-growth condition, and algorithmic meta-theorem hypotheses are all satisfied. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making the graph class, parameterized problem, minor- or contraction-monotonicity, quadratic grid-growth condition, and algorithmic meta-theorem hypotheses are all satisfied the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Bidimensionality can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Bidimensionality. Bidimensionality compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed parameterized graph algorithms carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express the graph class, parameterized problem, minor- or contraction-monotonicity, quadratic grid-growth condition, and algorithmic meta-theorem hypotheses are all satisfied independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of parameterized graph algorithms because they reuse the typed parameterized graph algorithms carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, A large parameter-obstruction grid forces large value; conversely a small parameter excludes large grids and bounds treewidth, after which dynamic programming or decomposition algorithms apply., and type the carrier, state every parameter and convention in the definition, test that the graph class, parameterized problem, minor- or contraction-monotonicity, quadratic grid-growth condition, and algorithmic meta-theorem hypotheses are all satisfied, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Bidimensionality Domain-specific

Parents (1) — outgoing typed relations

• Bidimensionality is a kind of Classification Prime

  What makes it its own entry: the domain-specific identity determined by the graph class, parameterized problem, minor- or contraction-monotonicity, quadratic grid-growth condition, and algorithmic meta-theorem hypotheses are all satisfied.

Hierarchy path (1) — routes to 1 parentless root

• Bidimensionality → is a kind of Classification

Neighborhood in Abstraction Space

Bidimensionality sits in a crowded region of the domain-specific corpus (8^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graph Theory Structures & Invariants (48 abstractions)

Nearest neighbors

• Planarity testing — 0.92
• Dissociation number — 0.92
• Treewidth — 0.92
• Split graph — 0.91
• Matching (graph theory) — 0.91

Computed from structural-signature embeddings · 2026-10-25