3204 search results - page 504 / 641 » The b-chromatic Number of a Graph |
214
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
178
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
210
click to vote
IEEEPACT
2002
IEEE
15 years 11 months ago
2002
IEEE
Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve co...
180
click to vote
COCO
2000
Springer
15 years 11 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
175
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....