.png){kind=icon}
返回
Solving Problems on Recursively Constructed Graphs
.png){kind=icon}
PRE
AI
DOI：10.1145/1456650.1456654.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Fast algorithms can be created for many graph problems when instances are confined to classes of graphs that are recursively constructed. This article first describes some basic conceptual notions regarding the design of such fast algorithms, and then the coverage proceeds through several recursive graph classes. Specific classes include trees, series-parallel graphs, k-terminal graphs, treewidth-k graphs, k-trees, partial k-trees, k-jackknife graphs, pathwidth-k graphs, bandwidth-k graphs, cutwidth-k graphs, branchwidth-k graphs, Halin graphs, cographs, cliquewidth-k graphs, k-NLC graphs, k-HB graphs, and rankwidth-k graphs. The definition of each class is provided. Typical algorithms are applied to solve problems on instances of most classes. Relationships between the classes are also discussed.
Keyword:
Algorithms
Theory
Bandwidth
branchwidth
cliquewidth
cograph
cutwidth
dynamic programming
Halin graph
pathwidth
rankwidth
series parallel
tree
treewidth
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
28
论文数:
2.4K
被引数:
3.5W
机构
引用论文
The Polymorphisms in LNK Gene Correlated to the Clinical Type of Myeloproliferative Neoplasms.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏Symmetrical discrimination despite weak song differentiation in 2 suboscine bird sister species尽管在2个亚科鸟类姊妹物种中歌曲分化较弱，但仍具有对称性歧视
PREAI
分享收藏Rationale for the ASSAIL-MI-trial: a randomised controlled trial designed to assess the effect of tocilizumab on myocardial salvage in patients with acute ST-elevation myocardial infarction (STEMI)Open Heart
OAAI
Open HeartIF0
OAAI分享收藏Ascl2 activation by YAP1/KLF5 ensures the self-renewability of colon cancer progenitor cellsOncotargetOAAI
OncotargetIF0
OAAI分享收藏
查看更多内容