Capturing Polynomial Time using Modular Decomposition

03/29/2018
by   Berit Grußien, et al.
0

The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory. In 2010 Grohe showed that fixed point logic with counting captures polynomial time on all classes of graphs with excluded minors. We now consider classes of graphs with excluded induced subgraphs. For such graph classes, an effective graph decomposition, called modular decomposition, was introduced by Gallai in 1976. The graphs that are non-decomposable with respect to modular decomposition are called prime. We present a tool, the Modular Decomposition Theorem, that reduces (definable) canonization of a graph class C to (definable) canonization of the class of prime graphs of C that are colored with binary relations on a linearly ordered set. By an application of the Modular Decomposition Theorem, we show that fixed point logic with counting captures polynomial time on the class of permutation graphs. Within the proof of the Modular Decomposition Theorem, we show that the modular decomposition of a graph is definable in symmetric transitive closure logic with counting. We obtain that the modular decomposition tree is computable in logarithmic space. It follows that cograph recognition and cograph canonization is computable in logarithmic space.

READ FULL TEXT
research
02/28/2018

Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs

We show that the class of chordal claw-free graphs admits LREC=-definabl...
research
11/26/2018

Modular decomposition of graphs and hierarchical modeling

We consider Gallai's graph Modular Decomposition theory for network anal...
research
03/24/2020

Deep Weisfeiler Leman

We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL),...
research
01/21/2021

(α, β)-Modules in Graphs

Modular Decomposition focuses on repeatedly identifying a module M (a co...
research
07/08/2021

Choiceless Polynomial Time, Symmetric Circuits and Cai-Fürer-Immerman Graphs

Choiceless Polynomial Time (CPT) is currently the only candidate logic f...
research
11/09/2021

Modular Decomposition of Hierarchical Finite State Machines

In this paper we develop an analogue of the graph-theoretic `modular dec...
research
10/12/2017

Modular decomposition of transitive graphs and transitively orienting their complements

The modular decomposition of a graph is a canonical representation of it...

Please sign up or login with your details

Forgot password? Click here to reset