3958 search results - page 314 / 792 » Dynamic Graph Algorithms with Applications |
240
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
189
click to vote
ISPASS
2009
IEEE
16 years 1 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
204
click to vote
IPSN
2004
Springer
16 years 2 days ago
2004
Springer
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
154
click to vote
INFOCOM
1991
IEEE
15 years 10 months ago
1991
IEEE
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
170
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...