1972 search results - page 128 / 395 » connection 2008 |
87
Voted
IPL
2007
15 years 29 days ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
101
Voted
OPODIS
2008
15 years 2 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
114
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
JDCTA
2008
15 years 1 months ago
2008
Tourism industry is one of the important sources of income in many countries. The appropriate and quick submission of primary information such as address of hotels to the tourists...
126
Voted
CONSTRAINTS
2006
15 years 1 months ago
2006
Topological relations are important in various tasks of spatial reasoning, scene description and object recognition. The RCC8 spatial constraint language developed by Randell, Cui...