Rank-width: Algorithmic and structural results
Not on the map. Why?
Abstract (arXiv)
Rank-width is a width parameter of graphs describing whether it is possible to decompose a graph into a tree-like structure by `simple' cuts. This survey aims to summarize known algorithmic and structural results on rank-width of graphs.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 15 Jan 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.