  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.
