Algorithmic Meta Theorems for Sparse Graph Classes

  title={Algorithmic Meta Theorems for Sparse Graph Classes},
  author={Martin Grohe},
  • Martin Grohe
  • Published in CSR 7 June 2014
  • Computer Science, Mathematics
Algorithmic meta theorems give efficient algorithms for classes of algorithmic problems, instead of just individual problems. They unify families of algorithmic results obtained by similar techniques and thus exhibit the core of these techniques. The classes of problems are typically defined in terms of logic and structural graph theory. A well-known example of an algorithmic meta theorem is Courcelle’s Theorem, stating that all properties of graphs of bounded tree width that are definable in… 

Deciding first-order properties of nowhere dense graphs

It is shown that deciding properties of graphs definable in first-order logic is fixed-parameter tractable on nowhere dense graph classes, and a "rank-preserving" version of Gaifman's locality theorem is proved.

On the Width of Regular Classes of Finite Structures

It is shown that the problem of counting satisfying assignments for a first-order logic formula in a structure of constant width is fixed parameter tractable when parameterized by the width parameter and can be solved in quadratic time with respect to the length of the input representation of the structure.

The parameterized space complexity of model-checking bounded variable first-order logic

The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database) and is studied under the assumption that Savitch's Theorem is optimal.

Symbolic Solutions for Symbolic Constraint Satisfaction Problems

The main result states that given an ordered decision diagram D of length k and width w specifying a CSP instance, one can determine in time f(w,w′) · k whether there is an ODD of width at most w′ encoding a solution for this instance.

Deciding First-Order Properties of Nowhere Dense Graphs

The proofs are based on a new game-theoretic characterization of nowhere dense graphs that allows for a recursive version of locality-based algorithms on these classes and prove a “rank-preserving” version of Gaifman’s locality theorem.



Logic, graphs, and algorithms

An introduction into the theory underlying algorithmic meta theorems and a survey of the most important results in this area are presented.

Algorithmic Meta-theorems

This paper presents Courcelle’s theorem that every decision problem definable in monadic second-order logic can be decided in linear time on any class of graphs of bounded tree-width.

Methods for Algorithmic Meta Theorems

This is a survey of algorithmic meta-theorems, highlighting the general methods available to prove such theorems rather than specific results.

A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory

A simple quadratic time algorithm for computing graph minor decompositions and combines techniques from logic and structural graph theory and Courcelle's Theorem stating that monadic second-order logic formulas can be evaluated in linear time on graphs of bounded tree width and Robertson and Seymour's so called Weak Structure Theorem.

Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth

New algorithmic meta theorems are contributed that state that mso-definable problems are solvable by uniform constant-depth circuit families when restricted to input structures of bounded tree depth and by uniform logarithmic-depth circuits when a tree decomposition of bounded width in term representation is part of the input.

Easy Problems for Tree-Decomposable Graphs

FO Model Checking of Interval Graphs

We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that this problem can

Deciding First-Order Properties for Sparse Graphs

An almost linear-time algorithm for deciding first-order logic (FOL) properties in classes of graphs with bounded expansion and a dynamic data structure for graphs belonging to a fixed class of graphs of bounded expansion for testing existential properties or the existence of short paths between prescribed vertices.

Parameterized Complexity Theory

  • J. FlumMartin Grohe
  • Computer Science
    Texts in Theoretical Computer Science. An EATCS Series
  • 2006
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two Fundamental Hierarchies.- The First Level of the Hierarchies.- The

Generalized Model-Checking over Locally Tree-Decomposable Classes

  • M. Frick
  • Mathematics, Computer Science
    Theory of Computing Systems
  • 2003
More general computational problems than decision problems, which are induced by formulas with free variables are considered, and it is shown that each problems can be solved in linear time on locally tree-decomposable classes of structures.