2310 search results - page 164 / 462 » Coloring Random Graphs |
119
click to vote
RANDOM
1999
Springer
15 years 6 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
104
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
113
Voted
ECRTS
2007
IEEE
15 years 8 months ago
2007
IEEE
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
123
click to vote
SIROCCO
2000
15 years 3 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
126
Voted
JSAC
2007
15 years 2 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...