Sciweavers

270 search results - page 20 / 54
» Properties of Almost All Graphs and Generalized Quantifiers
Sort
View
JCT
2011
90views more  JCT 2011»
13 years 2 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
IPPS
2000
IEEE
13 years 11 months ago
Broadcasting in Hypercubes in the Circuit Switched Model
In this paper, we propose a method which enables us to construct almost optimal broadcast schemes on an n-dimensional hypercube in the circuit switched, -port model. In this mode...
Jean-Claude Bermond, Takako Kodate, Stephane Peren...
JCT
2011
93views more  JCT 2011»
12 years 10 months ago
A graph-theoretic approach to quasigroup cycle numbers
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
Brent Kerby, Jonathan D. H. Smith
JSYML
2002
170views more  JSYML 2002»
13 years 7 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
IANDC
2006
82views more  IANDC 2006»
13 years 7 months ago
Recognizability, hypergraph operations, and logical types
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
Achim Blumensath, Bruno Courcelle