Rank-width: Algorithmic and structural results

Sang-il Oum
2017 Discrete Applied Mathematics  
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.
doi:10.1016/j.dam.2016.08.006 fatcat:pvvs5yq5hvhxderfshfih3atti