Thumbnail
Access Restriction
Subscribed

Author Borie, Richard B. ♦ Parker, R. Gary ♦ Tovey, Craig A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2008
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Bandwidth ♦ Halin graph ♦ Branchwidth ♦ Cliquewidth ♦ Cograph ♦ Cutwidth ♦ Dynamic programming ♦ Pathwidth ♦ Rankwidth ♦ Series parallel ♦ Tree ♦ Treewidth
Abstract 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, $\textit{k}-terminal$ graphs, $treewidth-\textit{k}$ graphs, $\textit{k}-trees,$ partial $\textit{k}-trees,$ $\textit{k}-jackknife$ graphs, $pathwidth-\textit{k}$ graphs, $bandwidth-\textit{k}$ graphs, $cutwidth-\textit{k}$ graphs, $branchwidth-\textit{k}$ graphs, Halin graphs, cographs, $cliquewidth-\textit{k}$ graphs, $\textit{k}-NLC$ graphs, $\textit{k}-HB$ graphs, and $rankwidth-\textit{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.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2009-01-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 41
Issue Number 1
Page Count 51
Starting Page 1
Ending Page 51


Open content in new tab

   Open content in new tab
Source: ACM Digital Library