Approximating Clique-Width and Branch-Width

Oum, S., & Seymour, P. (2006). Approximating Clique-Width and Branch-Width.

Type

Unclassified

Intellectual base

Unclassified

Year

2006

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Rank-width
  • Rank-width is the minimum across rank decompositions of the maximum GF(2) rank of the bipartite adjacency matrix between the two vertex sides induced by any decomposition-tree edge.

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:1698cb0dae7d · see in the full table