3415 search results - page 416 / 683 » Lower bounds on kernelization |
165
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
166
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
173
click to vote
ISPAN
1999
IEEE
15 years 11 months ago
1999
IEEE
Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple use...
148
click to vote
ICCAD
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper presents two new algorithms, Redundant Vector Elimination(RVE) and Essential Fault Reduction (EFR), for generating compact test sets for combinational circuits under th...
153
click to vote
ICPADS
1998
IEEE
15 years 11 months ago
1998
IEEE
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...