1736 search results - page 106 / 348 » On antimagic directed graphs |
169
click to vote
SAC
2005
ACM
15 years 11 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
151
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
141
click to vote
ICNP
2000
IEEE
15 years 10 months ago
2000
IEEE
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
170
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
187
click to vote
PVLDB
2010
15 years 27 days ago
2010
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...