We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initializatio...