The modular decomposition of countable graphs : Definition and construction in monadic second-order logic

We generalise the modular polynomial for elliptic curves to a tuple of modular polynomials for principally polarised ordinary abelian varieties with real multiplication by the

• In Part II, we investigate two graph colouring and weighting problems (which are specific cases of partition problems) in which one aims at making the adjacent vertices of a graph

We show an upper bound for the maximum vertex degree of any z-oblique graph imbedded into a given surface.. Moreover, an upper bound for the maximum face degree

As mentioned in the introduction, Theorem 2.3 immediately lifts to structures of bounded tree- width: for all queries φ ∈ MSO and all k ∈ N there is a linear time and constant

As we show, the first order-theory of ordering constraints over sufficiently labeled feature trees is equivalent to second-order monadic logic (S2S for infinite and WS2S for

More precisely, Van Benthem first shows that the bisimulation invariant fragment of first order logic (FO, the 0th level of the monadic hierarchy) equals modal logic (the 0th level

VS : Vitesse de sédimentation.. L'arthroplastie de la hanche représente le moyen thérapeutique le plus efficace et le plus efficient du traitement des différentes affections

We describe a simple conditional lower bound that, for any constant > 0, an O(|E| 1− m)-time or an O(|E| m 1− )-time algorithm for exact pattern matching on graphs, with node