2252 search results - page 155 / 451 » Lower Bounds for Dynamic Algorithms |
134
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
133
Voted
AIEDAM
2008
15 years 3 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
131
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
153
Voted
JGAA
2007
15 years 3 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
130
click to vote
JNW
2007
15 years 3 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...