期刊
DISCRETE APPLIED MATHEMATICS
卷 231, 期 -, 页码 15-24出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2016.08.006
关键词
Rank-width; Clique-width; NLC-width; Vertex-minor; Boolean-width
资金
- Basic Science Research Program through the National Research Foundation of Korea (NRF) - Ministry of Science, ICT & Future Planning [2011-0011653]
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. (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
