Construct · 1 fields · 1 citations

Courcelle's theorem: 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.

Parameterized complexity

the result that any graph property expressible in monadic second-order logic can be decided in linear time on graphs of bounded treewidth.

In parameterized complexity, Courcelle's theorem refers to the result that any graph property expressible in monadic second-order logic can be decided in linear time on graphs of bounded treewidth. This meaning comes from Courcelle (1990) in Information and Computation.[1]

Unit
Recovery means
Measured by

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

See how Courcelle's theorem 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

complexity4 fields · 7 citationsjingle · one word, four constructs information4 fields · 5 citationsjingle · one word, four constructs property4 fields · 4 citationsjingle · one word, four constructs

References

Courcelle, B. (1990). The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation, 85(1), 12-75. https://doi.org/10.1016/0890-5401(90)90043-h

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