Twin-Width Meets Feedback Edges and Vertex Integrity

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F24%3A00136984" target="_blank" >RIV/00216224:14330/24:00136984 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.4230/LIPIcs.IPEC.2024.3" target="_blank" >https://doi.org/10.4230/LIPIcs.IPEC.2024.3</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.IPEC.2024.3" target="_blank" >10.4230/LIPIcs.IPEC.2024.3</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Twin-Width Meets Feedback Edges and Vertex Integrity

Popis výsledku v původním jazyce

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ázev v anglickém jazyce

Twin-Width Meets Feedback Edges and Vertex Integrity

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

International Symposium on Parameterized and Exact Computation (IPEC)

ISBN

9783959773539

ISSN

1868-8969

e-ISSN

—

Počet stran výsledku

22

Strana od-do

„3:1“-„3:22“

Název nakladatele

Schloss Dagstuhl - Leibniz-Zentrum f{"{u}}r Informatik

Místo vydání

Dagstuhl

Místo konání akce

Egham

Datum konání akce

4. 9. 2024

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—