A mathematical concept known as a de Bruijn graph turns the formidable challenge of assembling a contiguous genome from billions of short sequencing reads into a tractable computational problem. You ...

In this paper, motivated by the study of the wide diameter and the Rabin number of graphs, we define the generalized k-diameter of k-connected graphs, and show that every k-regular k-connected graph ...

SIAM Journal on Applied Mathematics, Vol. 26, No. 2 (Mar., 1974), pp. 313-314 (2 pages) A very short new constructive proof is presented of a result of Edmond's that a set of degrees each at least k ...

With the rapid development of mobile networks, location-based services have become deeply embedded in people's daily lives. Although the k-NN search problem has obtained a lot of research results, the ...