How to Decompose a Graph into a Tree-Like Structure (Invited Talk).
ISAAC(2020)
Abstract
Many NP-hard problems on graphs are known to be tractable if we restrict the input to have a certain decomposition into a tree-like structure. Width parameters of graphs are measures on how easy it is to decompose the input graph into a tree-like structure. The tree-width is one of the most well-studied width parameters of graphs and the rank-width is a generalization of tree-width into dense graphs. This talk will present a survey on width parameters of graphs such as tree-width and rank-width and discuss known algorithms to find a decomposition of an input graph into such tree-like structures efficiently. 2012 ACM Subject Classification Theory of computation → Data structures design and analysis; Mathematics of computing → Discrete mathematics
MoreTranslated text
Key words
Graph Transformation,Graph Coloring,Graph Theory,Temporal Reasoning,Parameterized Complexity
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined