dc.contributor.author | Eiben, Eduard | |
dc.contributor.author | Ganian, Robert | |
dc.contributor.author | Hamm, Thekla | |
dc.contributor.author | Jaffke, Lars | |
dc.contributor.author | Kwon, O-joung | |
dc.date.accessioned | 2023-01-04T13:38:35Z | |
dc.date.available | 2023-01-04T13:38:35Z | |
dc.date.created | 2023-01-03T09:40:22Z | |
dc.date.issued | 2022 | |
dc.identifier.issn | 1868-8969 | |
dc.identifier.uri | https://hdl.handle.net/11250/3040986 | |
dc.description.abstract | Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specific width parameters. Moreover, for mim-width, no efficient algorithms for computing good decompositions were known, even under highly restrictive parameterizations. In this work we identify ℱ-branchwidth as a class of generic decompositional parameters that can capture mim-width, treewidth, clique-width as well as other measures. We show that while there is an infinite number of ℱ-branchwidth parameters, only a handful of these are asymptotically distinct. We then develop fixed-parameter and kernelization algorithms (under several structural parameterizations) that can approximate every possible ℱ-branchwidth, providing a unifying parameterized framework that can efficiently obtain near-optimal tree-decompositions, k-expressions, as well as optimal mim-width decompositions. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Dagstuhl Publishing | en_US |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | A Unifying Framework for Characterizing and Computing Width Measures | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright 2022 The Author(s) | en_US |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |
dc.identifier.doi | 10.4230/LIPIcs.ITCS.2022.63 | |
dc.identifier.cristin | 2099349 | |
dc.source.journal | Leibniz International Proceedings in Informatics | en_US |
dc.source.pagenumber | 63:1-63:23 | en_US |
dc.identifier.citation | Leibniz International Proceedings in Informatics. 2022, 215, 63:1-63:23. | en_US |
dc.source.volume | 215 | en_US |