Rank-width: algorithmic and structural results
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.
- Publisher
- ELSEVIER SCIENCE BV
- Issue Date
- 2017-11
- Language
- English
- Article Type
- Article
- Keywords
MINIMIZING SUBMODULAR FUNCTIONS; STRONGLY POLYNOMIAL-TIME; CLIQUE-WIDTH; GRAPH MINORS; VERTEX-MINORS; TREE-WIDTH; BRANCH-WIDTH; ISOTROPIC SYSTEMS; OBSTRUCTIONS; CONJECTURE
- Citation
DISCRETE APPLIED MATHEMATICS, v.231, pp.15 - 24
- ISSN
- 0166-218X
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 26 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.