Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
We introduce the notion of z-topological orderings for digraphs. We prove that given a digraph G on n vertices admitting a z-topological ordering, together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula ϕ and are the union of kdirected paths, in time f(ϕ,k,z)·nO(k·z). Our result implies the polynomial time solvability of many natural counting problems on digraphs admitting z-topological orderings for constant values of z and k. Concerning the relationship between z-topological orderability and other digraph width measures, we observe that any digraph of directed path-width d has a z-topological ordering for z ≤ 2d + 1. On the other hand, there are digraphs on n vertices admitting a z-topological order for z = 2, but whose directed path-width is Θ(logn). Since graphs of bounded directed path-width can have both arbitrarily large undirected tree-width and arbitrarily large clique width, our result provides for the first time a suitable way of partially transposing metatheorems developed in the context of the monadic second order logic of graphs of constant undirected tree-width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree-width and arbitrarily large clique width.
KeywordsSlice Theory Digraph Width Measures Monadic Second Order Logic of Graphs Algorithmic Meta-theorems
Unable to display preview. Download preview PDF.
- 13.Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, pp. 194–242 (1990)Google Scholar
- 14.Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, vol. 138. Cambridge University Press (2012)Google Scholar
- 19.de Oliveira Oliveira, M.: Subgraphs satisfying MSO properties on z-topologically orderable digraphs. Preprint (full version of this paper) arXiv:1303.4443 (2013)Google Scholar
- 20.Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness. In: Complexity Theory: Current Research, pp. 191–225 (1992)Google Scholar
- 23.Evans, W., Hunter, P., Safari, M.: D-width and cops and robbers. Manuscript (2007)Google Scholar
- 26.Ganian, R., Hlinený, P., Langer, A., Obdrzálek, J., Rossmanith, P., Sikdar, S.: Lower bounds on the complexity of MSO1 model-checking. In: STACS 2012, vol. 14, pp. 326–337 (2012)Google Scholar
- 29.Gruber, H.: On the d-width of directed graphs. Manuscript (2007)Google Scholar
- 30.Gruber, H.: Digraph complexity measures and applications in formal language theory. Discrete Math. & Theor. Computer Science 14(2), 189–204 (2012)Google Scholar
- 34.Kreutzer, S.: On the parameterized intractability of monadic second-order logic. Logical Methods in Computer Science 8(1) (2012)Google Scholar
- 35.Kreutzer, S., Tazari, S.: Lower bounds for the complexity of monadic second-order logic. In: LICS, pp. 189–198 (2010)Google Scholar
- 37.Matz, O., Thomas, W.: The monadic quantifier alternation hierarchy over graphs is infinite. In: LICS, pp. 236–244 (1997)Google Scholar
- 43.Thomas, W.: Finite-state recognizability of graph properties. Theorie des Automates et Applications 172, 147–159 (1992)Google Scholar