2063 search results - page 111 / 413 » connection 2007 |
130
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
165
click to vote
ICA3PP
2007
Springer
15 years 10 months ago
2007
Springer
Ubiquitous communications require wireless networking and infrastructure network support. The first step is to look at how the different available technologies will integrate and w...
116
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
126
click to vote
ACISP
2007
Springer
15 years 8 months ago
2007
Springer
This paper studies the interplay of network connectivity and perfectly secure message transmission under the corrupting influence of a Byzantine mobile adversary that may move from...
146
click to vote
EUROPAR
2007
Springer
15 years 8 months ago
2007
Springer
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...