| Title: | Computing tree decompositions with small independence number |
|---|
| Authors: | ID Dallard, Clément Jean (Author)
ID Fomin, Fedor V. (Author)
ID Golovach, Petr A. (Author)
ID Korhonen, Tuukka (Author)
ID Milanič, Martin (Author) |
|---|
| Files: |  RAZ_Dallard_Clement_Jean_2026.pdf (1,45 MB)
MD5: 429042850FF9E8EA628A32E483E28311
 https://dl.acm.org/doi/10.1145/3767730
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FAMNIT - Faculty of Mathematics, Science and Information Technologies
IAM - Andrej Marušič Institute
|
|---|
| Abstract: | The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the minimum independence number of a tree decomposition of it. Several NP-hard graph problems, like maximum-weight independent set, can be solved in time n^O(k) if the input n-vertex graph is given together with a tree decomposition of independence number k. Yolov, in SODA 2018, gave an algorithm that, given an n-vertex graph G and an integer k, in time n^O(k^3) either constructs a tree decomposition of G whose independence number is O(k^3) or correctly reports that the tree-independence number of G is larger than k. In this article, we first give an algorithm for computing the tree-independence number with a better approximation ratio and running time and then prove that our algorithm is, in some sense, the best one can hope for. Our second result is that the exact computation of the tree-independence number is para-NP-hard: We show that for every constant k ≥ 4 it is NP-complete to decide whether a given graph has the tree-independence number at most k. |
|---|
| Keywords: | tree-independence number, approximation, parameterized algorithm |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 10.11.2025 |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | str. 1-26 |
|---|
| Numbering: | Vol. 22, no. 1, [article no.] 12 |
|---|
| PID: | 20.500.12556/RUP-22213  |
|---|
| UDC: | 51 |
|---|
| ISSN on article: | 1549-6325 |
|---|
| DOI: | 10.1145/3767730 |
|---|
| COBISS.SI-ID: | 261744131 |
|---|
| Publication date in RUP: | 16.12.2025 |
|---|
| Views: | 232 |
|---|
| Downloads: | 3 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
