2026-07-25T03:00:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13345 2024-03-06T10:51:45Z ddc:004 open_access

How to Decompose a Graph into a Tree-Like Structure (Invited Talk) Oum, Sang-il tree-width rank-width 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sang-il Oum 2020 Is Part Of LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2020.1 urn:nbn:de:0030-drops-133458 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.1 eng https://creativecommons.org/licenses/by/3.0/legalcode