Are there any good digraph width measures?

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00087762" target="_blank" >RIV/00216224:14330/16:00087762 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.jctb.2015.09.001" target="_blank" >http://dx.doi.org/10.1016/j.jctb.2015.09.001</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jctb.2015.09.001" target="_blank" >10.1016/j.jctb.2015.09.001</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Are there any good digraph width measures?

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Are there any good digraph width measures?

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

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 periodika

Journal of Combinatorial Theory, Ser B

ISSN

0095-8956

e-ISSN

—

Svazek periodika

116

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

IN - Indická republika

Počet stran výsledku

37

Strana od-do

250-286

Kód UT WoS článku

000366344100011

EID výsledku v databázi Scopus

—