Are there any good digraph width measures?

J 2016

Are there any good digraph width measures?

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER et. al.

Základní údaje

Originální název

Are there any good digraph width measures?

Autoři

GANIAN, Robert (203 Česká republika), Petr HLINĚNÝ (203 Česká republika, garant, domácí), Jan OBDRŽÁLEK (203 Česká republika, domácí), Joachim KNEIS (276 Německo), Daniel MEISTER (276 Německo), Somnath SIKDAR (356 Indie) a Peter ROSSMANITH (276 Německo)

Vydání

Journal of Combinatorial Theory, Ser B, Academic Press, 2016, 0095-8956

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Indie

Utajení

není předmětem státního či obchodního tajemství

Impakt faktor

Impact factor: 0.829

Kód RIV

RIV/00216224:14330/16:00087762

Organizační jednotka

Fakulta informatiky

DOI

http://dx.doi.org/10.1016/j.jctb.2015.09.001

UT WoS

000366344100011

Klíčová slova anglicky

Tree-width; Digraph width; Directed minor; Cops-and-robber game

Štítky

formela-journal

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 17. 4. 2018 09:44, prof. RNDr. Petr Hliněný, Ph.D.

Anotace

V originále

Many width measures for directed graphs have been proposed in the last few years in pursuit of generalizing (the notion of) treewidth to directed graphs. However, none of these measures possesses, at the same time, the major properties of treewidth, namely, 1. being algorithmically useful , that is, admitting polynomial-time algorithms for a large class of problems on digraphs of bounded width (e.g. the problems definable in MSO1MSO1); 2. having nice structural properties such as being (at least nearly) monotone under taking subdigraphs and some form of arc contractions (property closely related to characterizability by particular cops-and-robber games). We investigate the question whether the search for directed treewidth counterparts has been unsuccessful by accident, or whether it has been doomed to fail from the beginning. Our main result states that any reasonable width measure for directed graphs which satisfies the two properties above must necessarily be similar to treewidth of the underlying undirected graph.

Návaznosti

GBP202/12/G061, projekt VaV

Název: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Akronym: CE-ITI)

Investor: Grantová agentura ČR, Centrum excelence - Institut teoretické informatiky

GC201/09/J021, projekt VaV

Název: Strukturální teorie grafů a parametrizovaná složitost

Investor: Grantová agentura ČR, Strukturální teorie grafů a parametrizovaná složitost

Přiložené soubory

1-s2.0-S0095895615001082-main.pdf

Vyhledat podobné dokumenty

Citovat

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR a Peter ROSSMANITH. Are there any good digraph width measures? Journal of Combinatorial Theory, Ser B. Academic Press, 2016, roč. 116, č. 1, s. 250-286. ISSN 0095-8956. Dostupné z: https://dx.doi.org/10.1016/j.jctb.2015.09.001.

@article{1323142,
   author = {Ganian, Robert and Hliněný, Petr and Obdržálek, Jan and Kneis, Joachim and Meister, Daniel and Sikdar, Somnath and Rossmanith, Peter},
   article_number = {1},
   doi = {http://dx.doi.org/10.1016/j.jctb.2015.09.001},
   keywords = {Tree-width; Digraph width; Directed minor; Cops-and-robber game},
   language = {eng},
   issn = {0095-8956},
   journal = {Journal of Combinatorial Theory, Ser B},
   title = {Are there any good digraph width measures?},
   volume = {116},
   year = {2016}
}

TY  - JOUR
ID  - 1323142
AU  - Ganian, Robert - Hliněný, Petr - Obdržálek, Jan - Kneis, Joachim - Meister, Daniel - Sikdar, Somnath - Rossmanith, Peter
PY  - 2016
TI  - Are there any good digraph width measures?
JF  - Journal of Combinatorial Theory, Ser B
VL  - 116
IS  - 1
SP  - 250-286
EP  - 250-286
PB  - Academic Press
SN  - 00958956
KW  - Tree-width
KW  - Digraph width
KW  - Directed minor
KW  - Cops-and-robber game
N2  - Many width measures for directed graphs have been proposed in the last few years in pursuit of generalizing (the notion of) treewidth to directed graphs. However, none of these measures possesses, at the same time, the major properties of treewidth, namely, 1. being algorithmically useful , that is, admitting polynomial-time algorithms for a large class of problems on digraphs of bounded width (e.g. the problems definable in MSO1MSO1); 2. having nice structural properties such as being (at least nearly) monotone under taking subdigraphs and some form of arc contractions (property closely related to characterizability by particular cops-and-robber games). We investigate the question whether the search for directed treewidth counterparts has been unsuccessful by accident, or whether it has been doomed to fail from the beginning. Our main result states that any reasonable width measure for directed graphs which satisfies the two properties above must necessarily be similar to treewidth of the underlying undirected graph.
ER  -

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR a Peter ROSSMANITH. Are there any good digraph width measures? \textit{Journal of Combinatorial Theory, Ser B}. Academic Press, 2016, roč.~116, č.~1, s.~250-286. ISSN~0095-8956. Dostupné z: https://dx.doi.org/10.1016/j.jctb.2015.09.001.

Podrobný výpis o publikaci