168 search results - page 16 / 34 » An Upper Bound for B2[2] Sequences |
DM
2008
13 years 8 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
ISTCS
1993
Springer
14 years 3 days ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...