The Rank-Width of the Square Grid

Jelínek, V. (2010). The Rank-Width of the Square Grid.

Type

Unclassified

Intellectual base

Unclassified

Year

2010

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Rank-width
  • … observable transfers from A tree has rank-width at most one because every decomposition cut exposes at most one independent cross-adjacency pattern. to A parameterized algorithm first obtains a bounded-rank decomposition and then performs dynamic programming over the limited cross-cut neighborhood information..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:8be8cc7105d6 · see in the full table