Construct · 1 fields · 1 citations

bidimensionality: 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

a property of graph parameters that grow with grid minors, giving subexponential parameterized algorithms on planar and minor-free graphs.

In parameterized complexity, bidimensionality refers to a property of graph parameters that grow with grid minors, giving subexponential parameterized algorithms on planar and minor-free graphs. This meaning comes from Demaine (2005) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

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

See how bidimensionality 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 grid4 fields · 4 citationsjingle · one word, four constructs property4 fields · 4 citationsjingle · one word, four constructs

References

Demaine, E. D., Fomin, F. V., Hajiaghayi, M., & Thilikos, D. M. (2005). Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs. Journal of the ACM, 52(6), 866-893. https://doi.org/10.1145/1101821.1101823

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