3 papers
cs.DS2014
A New Single-Source Shortest Path Algorithm for Nonnegative Weight Graph
Yunpeng Li
The single-source shortest path problem is a classical problem in the research field of graph algorithm. In this paper, a new single-source shortest path algorithm for nonnegative…
cs.DS2012
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
Ming-Yang Kao, Henry C. M. Leung, He Sun +1
Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of…
cs.DS2010
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks
Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han +3
Wireless Communication Networks based on Frequency Division Multiplexing (FDM in short) plays an important role in the field of communications, in which each request can be satisfi…