.png){kind=icon}
Return
Solving Problems on Recursively Constructed Graphs
.png){kind=icon}
PRE
AI
DOI：10.1145/1456650.1456654.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Algorithms
Theory
Bandwidth
branchwidth
cliquewidth
cograph
cutwidth
dynamic programming
Halin graph
pathwidth
rankwidth
series parallel
tree
treewidth
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
28
Papers:
2.4K
Citations:
3.5W
Organization
Cited Papers
The Polymorphisms in LNK Gene Correlated to the Clinical Type of Myeloproliferative Neoplasms.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSaveSymmetrical discrimination despite weak song differentiation in 2 suboscine bird sister species
PREAI
ShareSaveRationale 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
OAAIShareSaveAscl2 activation by YAP1/KLF5 ensures the self-renewability of colon cancer progenitor cellsOncotargetOAAI
OncotargetIF0
OAAIShareSave
View more