Clique-width: Harnessing the power of atoms

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10473967" target="_blank" >RIV/00216208:11320/23:10473967 - isvavai.cz</a>

Výsledek na webu

<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=nhNr0cl5BW" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=nhNr0cl5BW</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1002/jgt.23000" target="_blank" >10.1002/jgt.23000</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Clique-width: Harnessing the power of atoms

Popis výsledku v původním jazyce

Many NP-complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph class G if they are so on the atoms (graphs with no clique cut-set) of G. Hence, we initiate a systematic study into boundedness of clique-width of atoms of hereditary graph classes. A graph G is H-free if H is not an induced subgraph of G, and it is (H1,H2)-free if it is both H1-free and H2-free. A class of H-free graphs has bounded clique-width if and only if its atoms have this property. This is no longer true for (H1,H2)-free graphs, as evidenced by one known example. We prove the existence of another such pair (H1,H2) and classify the boundedness of clique-width on (H1,H2)-free atoms for all but 18 cases.

Název v anglickém jazyce

Clique-width: Harnessing the power of atoms

Popis výsledku anglicky

Many NP-complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph class G if they are so on the atoms (graphs with no clique cut-set) of G. Hence, we initiate a systematic study into boundedness of clique-width of atoms of hereditary graph classes. A graph G is H-free if H is not an induced subgraph of G, and it is (H1,H2)-free if it is both H1-free and H2-free. A class of H-free graphs has bounded clique-width if and only if its atoms have this property. This is no longer true for (H1,H2)-free graphs, as evidenced by one known example. We prove the existence of another such pair (H1,H2) and classify the boundedness of clique-width on (H1,H2)-free atoms for all but 18 cases.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/GA17-09142S" target="_blank" >GA17-09142S: Moderní algoritmy: Nové výzvy komplexních dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2023

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 periodika

Journal of Graph Theory

ISSN

0364-9024

e-ISSN

1097-0118

Svazek periodika

104

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

42

Strana od-do

769-810

Kód UT WoS článku

001025157100001

EID výsledku v databázi Scopus

2-s2.0-85164725790