Are there any good digraph width measures?
| Autoři | |
|---|---|
| Rok publikování | 2016 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | Journal of Combinatorial Theory, Ser B |
| Fakulta / Pracoviště MU | |
| Citace | |
| Doi | http://dx.doi.org/10.1016/j.jctb.2015.09.001 |
| Obor | Informatika |
| Klíčová slova | Tree-width; Digraph width; Directed minor; Cops-and-robber game |
| Přiložené soubory | |
| Popis | 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. |
| Související projekty: |