Are there any good digraph width measures?

Logo poskytovatele

Varování

Publikace nespadá pod Pedagogickou fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

GANIAN Robert HLINĚNÝ Petr OBDRŽÁLEK Jan KNEIS Joachim MEISTER Daniel SIKDAR Somnath ROSSMANITH Peter

Rok publikování 2010
Druh Článek ve sborníku
Konference Parameterized and exact computation, IPEC 2010
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www DOI
Doi http://dx.doi.org/10.1007/978-3-642-17493-3_14
Obor Informatika
Klíčová slova directed graphs; width measures; monadic second order logic; directed graph minors
Popis Several different measures for digraph width have appeared in the last few years. However, none of them shares all the ``nice'' properties of treewidth: First, being algorithmically useful - say, admitting polynomial-time algorithms for all MSO1-definable problems on digraphs of bounded width. And, second, having nice structural properties such as being monotone under taking subdigraphs and some form of arc contractions. Our main result then is that any reasonable algorithmically useful and structurally nice digraph measure cannot be substantially different from the treewidth of the underlying undirected graph
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.