LIPIcs.ISAAC.2020.1.pdf
- Filesize: 155 kB
- 1 pages
Document
How to Decompose a Graph into a Tree-Like Structure (Invited Talk)
Author
-
Part of:
Volume:
31st International Symposium on Algorithms and Computation (ISAAC 2020)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Algorithms and Computation (ISAAC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2020-12-04
Cite AsGet BibTex
Sang-il Oum. How to Decompose a Graph into a Tree-Like Structure (Invited Talk). In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ISAAC.2020.1
https://doi.org/10.4230/LIPIcs.ISAAC.2020.1
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Data structures design and analysis
- Mathematics of computing → Discrete mathematics
Keywords
- tree-width
- rank-width
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads