Twin-Width and Transductions of Proper k-Mixed-Thin Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F22%3A00127036" target="_blank" >RIV/00216224:14330/22:00127036 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-031-15914-5_4" target="_blank" >http://dx.doi.org/10.1007/978-3-031-15914-5_4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-15914-5_4" target="_blank" >10.1007/978-3-031-15914-5_4</a>
Alternative languages
Result language
angličtina
Original language name
Twin-Width and Transductions of Proper k-Mixed-Thin Graphs
Original language description
The new graph parameter twin-width, recently introduced by Bonnet et al., allows for an FPT algorithm for testing all FO properties of graphs. This makes classes of efficiently bounded twin-width attractive from the algorithmic point of view. In particular, such classes (of small twin-width) include proper interval graphs, and (as digraphs) posets of width k. Inspired by an existing generalization of interval graphs into so-called k-thin graphs, we define a new class of proper k-mixed-thin graphs which largely generalizes proper interval graphs. We prove that proper k-mixed-thin graphs have twin-width linear in k, and that a certain subclass of k-mixed-thin graphs is transduction-equivalent to posets of width ????′ such that there is a quadratic relation between k and ????′.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10200 - Computer and information sciences
Result continuities
Project
<a href="/en/project/GA20-04567S" target="_blank" >GA20-04567S: Structure of tractable instances of hard algorithmic problems on graphs</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
WG 2022: Graph-Theoretic Concepts in Computer Science
ISBN
9783031159138
ISSN
0302-9743
e-ISSN
1611-3349
Number of pages
13
Pages from-to
43-55
Publisher name
Springer Nature
Place of publication
Cham
Event location
Tübingen, Germany
Event date
Jan 1, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000866013700004