Rank-width: Algorithmic and structural results
Combinatorics
2018-05-16 v2 Data Structures and Algorithms
Abstract
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.
Keywords
Cite
@article{arxiv.1601.03800,
title = {Rank-width: Algorithmic and structural results},
author = {Sang-il Oum},
journal= {arXiv preprint arXiv:1601.03800},
year = {2018}
}
Comments
14 pages; minor revision