2024
Twin-Width Meets Feedback Edges and Vertex Integrity
BALABÁN, Jakub, Robert GANIAN a Mathis ROCTONZákladní údaje
Originální název
Twin-Width Meets Feedback Edges and Vertex Integrity
Autoři
BALABÁN, Jakub, Robert GANIAN a Mathis ROCTON
Vydání
International Symposium on Parameterized and Exact Computation (IPEC), od s. 1-22, 22 s. 2024
Další údaje
Typ výsledku
Stať ve sborníku
Utajení
není předmětem státního či obchodního tajemství
Organizační jednotka
Fakulta informatiky
Klíčová slova anglicky
twin-width; fixed-parameter algorithms; feedback edge number; vertex integrity
Příznaky
Mezinárodní význam, Recenzováno
Změněno: 18. 10. 2024 12:08, Mgr. Jakub Balabán
Anotace
V originále
The approximate computation of twin-width has attracted significant attention already since the moment the parameter was introduced. A recently proposed approach (STACS 2024) towards obtaining a better understanding of this question is to consider the approximability of twin-width via fixed-parameter algorithms whose running time depends not on twin-width itself, but rather on parameters which impose stronger restrictions on the input graph. The first step that article made in this direction is to establish the fixed-parameter approximability of twin-width (with an additive error of 1) when the runtime parameter is the feedback edge number. Here, we make several new steps in this research direction and obtain: (1) An asymptotically tight bound between twin-width and the feedback edge number; (2) A significantly improved fixed-parameter approximation algorithm for twin-width under the same runtime parameter (i.e., the feedback edge number) which circumvents many of the technicalities of the original result and simultaneously avoids its formerly non-elementary runtime dependency; and (3) An entirely new fixed-parameter approximation algorithm for twin-width when the runtime parameter is the vertex integrity of the graph.
Návaznosti
| MUNI/A/1592/2023, interní kód MU |
|