Construct · 1 fields · 1 citations

treewidth: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph algorithms

a graph measure of how closely a graph resembles a tree, defined through tree decompositions and used to make hard problems tractable.

In graph algorithms, treewidth refers to a graph measure of how closely a graph resembles a tree, defined through tree decompositions and used to make hard problems tractable. This meaning comes from Robertson (1986) in Journal of Algorithms.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how treewidth sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

Baker's technique1 fields · 1 citationsanchor · a standalone construct Courcelle's theorem1 fields · 1 citationsanchor · a standalone construct excluded grid theorem1 fields · 1 citationsanchor · a standalone construct

References

Robertson, N., & Seymour, P. D. (1986). Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7(3), 309-322. https://doi.org/10.1016/0196-6774(86)90023-4

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct