4913 search results - page 181 / 983 » Results and Perspectives of the G |
156
click to vote
NETWORKS
2002
15 years 6 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
205
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
221
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
176
click to vote
CRYPTO
2005
Springer
16 years 3 days ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
145
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...