We study the average-case complexity of shortest-paths problems in the vertexpotential model. The vertex-potential model is a family of probability distributions on complete directed graphs with arbitrary real edge lengths, but without negative cycles. We show that on a graph with n vertices and wit
A mobility model for studying wireless communication and the complexity of problems in the model
β Scribed by Raymond Greenlaw; Sanpawat Kantabutra; Pattama Longani
- Publisher
- John Wiley and Sons
- Year
- 2012
- Tongue
- English
- Weight
- 281 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Γ 4 operations q, y, = , the standard bit operation Shift, Ro
## Abstract We consider numerically, in the framework of the lakesβstraits model, the mobility of a DNA chain under fieldβinversion gelβelectrophoresis (FIGE). Here we investigate the role of the gel's structure on the mobility. We consider two situations: (i) a DNA chain fragment is bounded by two