3757 search results - page 629 / 752 » The overlap number of a graph |
179
click to vote
COCO
2000
Springer
15 years 10 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...
173
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....
218
click to vote
CONCUR
1998
Springer
15 years 10 months ago
1998
Springer
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
198
click to vote
ICPADS
1994
IEEE
15 years 10 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
167
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...