Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs

DOI10.1007/978-3-319-03898-8_12zbMath1406.68048arXiv1303.4443OpenAlexW2963197316MaRDI QIDQ2867078

Mateus de Oliveira Oliveira

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.4443

zbMATH Keywords

algorithmic meta-theoremsmonadic second-order logic of graphsdigraph width measuresslice theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Logic in computer science (03B70) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) General topics in the theory of algorithms (68W01)

Related Items (6)

An algorithmic metatheorem for directed treewidth ⋮ Computing the zig-zag number of directed graphs ⋮ Reachability in Graph Transformation Systems and Slice Languages ⋮ Order Reconfiguration under Width Constraints ⋮ Causality in Bounded Petri Nets is MSO Definable ⋮ A Slice Theoretic Approach for Embedding Problems on Digraphs

This page was built for publication: Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs