On the Hardness of Switching to a Small Number of Edges

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10333131" target="_blank" >RIV/00216208:11320/16:10333131 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-42634-1_13" target="_blank" >http://dx.doi.org/10.1007/978-3-319-42634-1_13</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-42634-1_13" target="_blank" >10.1007/978-3-319-42634-1_13</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On the Hardness of Switching to a Small Number of Edges

Popis výsledku v původním jazyce

Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelinkova et al. [DMTCS 13, no. 2, 2011] presented a proof that it is NP-complete to decide if the input graph can be switched to contain at most a given number of edges. There turns out to be a flaw in their proof. We present a correct proof. Furthermore, we prove that the problem remains NP-complete even when restricted to graphs whose density is bounded from above by an arbitrary fixed constant. This partially answers a question of Matou. sek and Wagner [Discrete Comput. Geom. 52, no. 1, 2014].

Název v anglickém jazyce

On the Hardness of Switching to a Small Number of Edges

Popis výsledku anglicky

Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelinkova et al. [DMTCS 13, no. 2, 2011] presented a proof that it is NP-complete to decide if the input graph can be switched to contain at most a given number of edges. There turns out to be a flaw in their proof. We present a correct proof. Furthermore, we prove that the problem remains NP-complete even when restricted to graphs whose density is bounded from above by an arbitrary fixed constant. This partially answers a question of Matou. sek and Wagner [Discrete Comput. Geom. 52, no. 1, 2014].

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Centrum excelence - Institut teoretické informatiky (CE-ITI)</a><br>

Návaznosti

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

Rok uplatnění

2016

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

COMPUTING AND COMBINATORICS, COCOON 2016

ISBN

978-3-319-42633-4

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

12

Strana od-do

159-170

Název nakladatele

SPRINGER INT PUBLISHING AG

Místo vydání

CHAM

Místo konání akce

Ho Chi Minh City

Datum konání akce

2. 8. 2016

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

WRD - Celosvětová akce

Kód UT WoS článku

000389726400013