Article ID Journal Published Year Pages File Type
4949491 Discrete Applied Mathematics 2017 10 Pages PDF
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
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Rank-width: Algorithmic and structural results
Authors
,