ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
