Results 1  10
of
38,973
SublinearTime Algorithms for Tournament Graphs
"... Abstract. We show that a random walk on a tournament on n vertices finds either a sink or a 3cycle in expected time O n · log n · log ∗ n that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result is motivated by the search of a generic alg ..."
Abstract
 Add to MetaCart
Abstract. We show that a random walk on a tournament on n vertices finds either a sink or a 3cycle in expected time O n · log n · log ∗ n that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result is motivated by the search of a generic
Counting Stars and Other Small Subgraphs in Sublinear Time
"... Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biology to the study of the WorldWideWeb. Several polynomialtime algorithms have been suggested for counting or detecting t ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
the number of occurrences of certain network motifs. However, a need for more efficient algorithms arises when the input graph is very large, as is indeed the case in many applications of motif counting. In this paper we design sublineartime algorithms for approximating the number of copies of certain
A SublinearTime Approximation Scheme for Bin Packing
, 2008
"... The bin packing problem is defined as follows: given a set of n items with sizes 0 < w1, w2,...,wn ≤ 1, find a packing of these items into minimum number of unitsize bins possible. We present a sublineartime asymptotic approximation scheme for the bin packing problem; that is, for any ɛ> 0, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, we present an algorithm Aɛ that has sampling access to the input instance and outputs a value k such that Copt ≤ k ≤ (1+ɛ)·Copt+1, where Copt is the cost of an optimal solution. It is clear that uniform sampling by itself will not allow a sublineartime algorithm in this setting; a small number
A NearOptimal SublinearTime Algorithm for Approximating the Minimum Vertex Cover Size
, 2011
"... We give a nearly optimal sublineartime algorithm for approximating the size of a minimum vertex cover in a graph G. The algorithm may query the degree deg(v) of any vertex v of its choice, and for each 1 ≤ i ≤ deg(v), it may ask for the ith neighbor of v. Letting VCopt(G) denote the minimum size of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We give a nearly optimal sublineartime algorithm for approximating the size of a minimum vertex cover in a graph G. The algorithm may query the degree deg(v) of any vertex v of its choice, and for each 1 ≤ i ≤ deg(v), it may ask for the ith neighbor of v. Letting VCopt(G) denote the minimum size
MultiScale Matrix Sampling and SublinearTime PageRank Computation ∗
, 1202
"... A fundamental problem arising in many applications in Web science and social network analysis is the problem of identifying all nodes in a network whose PageRank exceeds a given threshold ∆. In this paper, we study the probabilistic version of the problem where given an arbitrary approximation facto ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(n/∆) on networkswith n nodes, where the tilde hides a polylogarithmicfactor. We show that any algorithm for solving this problem must have runtime of Ω(n/∆), rendering our algorithm optimal up to logarithmic factors. Our algorithm has sublinear time complexity for applications including Web crawling and Web search
SublinearTime Approximation of Euclidean Minimum Spanning Tree Artur Czumaj
"... Abstract We consider the problem of computing the weight of a Euclideanminimum spanning tree for a set of n points in R d. We focus on the situation when the input point set is supported by certain basic (andcommonly used) geometric data structures that can provide efficient access to the input in a ..."
Abstract
 Add to MetaCart
in a structured way. We present an algorithmthat estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within 1 + " using only eO( p n poly(1=")) queries for constant d. The algorithm assumesthat the input is supported by a minimal
Finding Cycles and Trees in Sublinear Time
, 2011
"... We present sublineartime (randomized) algorithms for finding simple cycles of length at least k ≥ 3 and treeminors in boundeddegree graphs. The complexity of these algorithms is related to the distance of the graph from being Ckminor free (resp., free from having the corresponding treeminor). I ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present sublineartime (randomized) algorithms for finding simple cycles of length at least k ≥ 3 and treeminors in boundeddegree graphs. The complexity of these algorithms is related to the distance of the graph from being Ckminor free (resp., free from having the corresponding tree
A sublinear time algorithm for pagerank computations
 In WAW
, 2012
"... Abstract. In a network, identifying all vertices whose PageRank is more than a given threshold value ∆ is a basic problem that has arisen in Web and social network analyses. In this paper, we develop a nearly optimal, sublinear time, randomized algorithm for a close variant of this problem. When giv ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Abstract. In a network, identifying all vertices whose PageRank is more than a given threshold value ∆ is a basic problem that has arisen in Web and social network analyses. In this paper, we develop a nearly optimal, sublinear time, randomized algorithm for a close variant of this problem. When
Sublinear Time Algorithms for Metric Space Problems
, 2000
"... Abstract In this paper we give approximation algorithms for the following problems on metric spaces: Furthest Pair, kmedian, Minimum Routing Cost Spanning Tree, Multiple Sequence Alignment, Maximum Traveling Salesman Problem, Maximum Spanning Tree and Average Distance. The key property of our algor ..."
Abstract
 Add to MetaCart
algorithms is that their running times is linear in the number of points. As the full specification of an npoint metric space is of size \Theta (n2), the complexity of our algorithms is sublinear with respect to the input size. All previous algorithms (exact or approximate) for these problems have running
Results 1  10
of
38,973