Results 121 to 130 of about 1,681 (204)
GRAPH DECOMPOSITIONS AND MONADIC SECOND ORDER LOGIC
, 2009 A tree decomposition is a tool which allows for analysis of the underlying tree structure of graphs which are not trees. Given a class of graphs with bounded tree width, many NP-complete problems can be computed in linear time for graphs in the class ...
Jonathan D. Adler, Adler, Jonathan D
core
The Dialectical Mandala Model of Self-cultivation. [PDF]
Front Psychol, 2022 Azanlansh OC.
europepmc +1 more source
One Quantifier Will Do in Existential Monadic Second-Order Logic over Pictures
, 1998 . We show that every formula of the existential fragment of monadic second-order logic over picture models (i.e., finite, two-dimensional, coloured grids) is equivalent to one with only one existential monadic quantifier.
Oliver Matz
core
, 1991 Context-free graph-grammars are considered such that, in every generated graph G, a derivation tree of G can be constructed by means of monadic second-order formulas that specify its nodes, its labels, the successors of a node etc. A subset of the set of
Courcelle, Bruno
core +1 more source
Clique-Width, Monadic-Second Order Logic And Efficient Algorithms
, 2000 We present clique-width, the characterization of classes of graphs of bounded clique-width as images of trees under monadic second-order definable transductions, the applications to the construction of efficient algorithms for monadic second-order ...
B. Courcelle
core
The Complexity of First-order and Monadic Second-order Logic Revisited
, 2002 The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower bounds for fixed-parameter tractable model-checking problems for first ...
Martin Grohe, Markus Frick
core
P 6- and triangle-free graphs revisited: structure and bounded clique-width
Discrete Mathematics & Theoretical Computer Science, 2006 The Maximum Weight Stable Set (MWS) Problem is one of the fundamental problems on graphs. It is well-known to be NP-complete for triangle-free graphs, and Mosca has shown that it is solvable in polynomial time when restricted to P 6- and triangle ...
Andreas Brandstädt +2 more
doaj
Variation in the timing of Covid-19 communication across universities in the UK. [PDF]
PLoS One, 2021 Quiroz Flores A +3 more
europepmc +1 more source
Open future, supervaluationism and the growing-block theory: a stage-theoretical account. [PDF]
Synthese, 2021 Loss R.
europepmc +1 more source