50 search results - page 7 / 10 » A Lower Bound on the Transposition Diameter |
104
Voted
JCT
2011
14 years 6 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
108
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
PODC
2009
ACM
16 years 6 days ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
SIROCCO
2004
15 years 1 months ago
2004
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
COCOON
1999
Springer
15 years 4 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...