1986 search results - page 168 / 398 » Path Separability of Graphs |
GC
2004
Springer
14 years 3 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
BPM
2010
Springer
13 years 11 months ago
2010
Springer
We propose a new semantics for the inclusive converging gateway (also known as Or-join). The new semantics coincides with the intuitive, widely agreed semantics for Or-joins on sou...
BROADNETS
2006
IEEE
14 years 4 months ago
2006
IEEE
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
MICS
2010
13 years 8 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...