# Rank-width: Algorithmic and structural results

arXiv: https://arxiv.org/abs/1601.03800 · HTML: https://mlsanity.com/paper/1601.03800/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Jan 2016.

## Built on by (most cited first, 1 of 1)

- [Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks](https://mlsanity.com/paper/2305.19659/) (2023)

## 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.