BALABÁN, Jakub and Petr HLINĚNÝ. Twin-Width is Linear in the Poset Width. Online. In Golovach, Petr A. and Zehavi, Meirav. International Symposium on Parameterized and Exact Computation (IPEC). 214th ed. Dagstuhl: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2021, p. "6:1"-"6:13", 13 pp. ISBN 978-3-95977-216-7. Available from: https://dx.doi.org/10.4230/LIPIcs.IPEC.2021.6.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Twin-Width is Linear in the Poset Width
Authors BALABÁN, Jakub (203 Czech Republic, belonging to the institution) and Petr HLINĚNÝ (203 Czech Republic, guarantor, belonging to the institution).
Edition 214. vyd. Dagstuhl, International Symposium on Parameterized and Exact Computation (IPEC), p. "6:1"-"6:13", 13 pp. 2021.
Publisher Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
WWW URL
RIV identification code RIV/00216224:14330/21:00119289
Organization unit Faculty of Informatics
ISBN 978-3-95977-216-7
ISSN 1868-8969
Doi http://dx.doi.org/10.4230/LIPIcs.IPEC.2021.6
Keywords in English twin-width; digraph; poset; FO model checking; contraction sequence
Tags firank_B, formela-conference
Tags International impact, Reviewed
Changed by Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 19/4/2022 10:03.
Abstract
Twin-width is a new parameter informally measuring how diverse are the neighbourhoods of the graph vertices, and it extends also to other binary relational structures, e.g. to digraphs and posets. It was introduced just very recently, in 2020 by Bonnet, Kim, Thomasse and Watrigant. One of the core results of these authors is that FO model checking on graph classes of bounded twin-width is in FPT. With that result, they also claimed that posets of bounded width have bounded twin-width, thus capturing prior result on FO model checking of posets of bounded width in FPT. However, their translation from poset width to twin-width was indirect and giving only a very loose double-exponential bound. We prove that posets of width d have twin-width at most 9d with a direct and elegant argument, and show that this bound is asymptotically tight. Specially, for posets of width 2 we prove that in the worst case their twin-width is also equal 2. These two theoretical results are complemented with straightforward algorithms to construct the respective contraction sequence for a given poset.
Links
GA20-04567S, research and development projectName: Struktura efektivně řešitelných případů těžkých algoritmických problémů na grafech
Investor: Czech Science Foundation
MUNI/A/1108/2020, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace X. (Acronym: SV-FI MAV X.)
Investor: Masaryk University
PrintDisplayed: 17/7/2024 19:33