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%2F20%3A10422372" target="_blank" >RIV/00216208:11320/20:10422372 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-60440-0_10" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-60440-0_10</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-60440-0_10" target="_blank" >10.1007/978-3-030-60440-0_10</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  if they are so on the atoms (graphs with no clique cut-set) of  . 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 (????1,????2) -free if it is both ????1 -free and ????2 -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 (????1,????2) -free graphs, as evidenced by one known example. We prove the existence of another such pair (????1,????2) and classify the boundedness of clique-width on (????1,????2) -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  if they are so on the atoms (graphs with no clique cut-set) of  . 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 (????1,????2) -free if it is both ????1 -free and ????2 -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 (????1,????2) -free graphs, as evidenced by one known example. We prove the existence of another such pair (????1,????2) and classify the boundedness of clique-width on (????1,????2) -free atoms for all but 18 cases.

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<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2020

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

Graph-Theoretic Concepts in Computer Science. WG 2020.

ISBN

978-3-030-60439-4

ISSN

—

e-ISSN

—

Počet stran výsledku

15

Strana od-do

119-133

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Leeds, Great Brittain

Datum konání akce

24. 6. 2020

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

WRD - Celosvětová akce

Kód UT WoS článku

—