1172 search results - page 114 / 235 » Path Algorithms on Regular Graphs |
104
click to vote
GC
2004
Springer
15 years 6 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...
110
click to vote
PC
2010
14 years 11 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
93
Voted
BROADNETS
2005
IEEE
15 years 6 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
129
click to vote
APSCC
2009
IEEE
15 years 7 months ago
2009
IEEE
What is a cloud application precisely? In this paper, we formulate a computing cloud as a kind of graph, a computing resource such as services or intellectual property access righ...
86
Voted
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...