Results 1  10
of
2,191
More algorithms for allpairs shortest paths in weighted graphs
 In Proceedings of 39th Annual ACM Symposium on Theory of Computing
, 2007
"... In the first part of the paper, we reexamine the allpairs shortest paths (APSP) problem and present a new algorithm with running time O(n 3 log 3 log n / log 2 n), which improves all known algorithms for general realweighted dense graphs. In the second part of the paper, we use fast matrix multipl ..."
Abstract

Cited by 75 (3 self)
 Add to MetaCart
)), where ω < 2.376; in two dimensions, this is O(n 2.922). Our framework greatly extends the previously considered case of smallintegerweighted graphs, and incidentally also yields the first truly subcubic result (near O(n 3−(3−ω)/4) = O(n 2.844) time) for APSP in realvertexweighted graphs, as well
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
the real QMR network to converge if the priors were sampled randomly in the range [0, Small priors are not the only thing that causes oscil lation. Small weights can, too. The effect of both The exact marginals are represented by the circles; the ends of the "error bars" represent the loopy
Robust Distributed Network Localization with Noisy Range Measurements
, 2004
"... This paper describes a distributed, lineartime algorithm for localizing sensor network nodes in the presence of range measurement noise and demonstrates the algorithm on a physical network. We introduce the probabilistic notion of robust quadrilaterals as a way to avoid flip ambiguities that otherw ..."
Abstract

Cited by 403 (20 self)
 Add to MetaCart
that otherwise corrupt localization computations. We formulate the localization problem as a twodimensional graph realization problem: given a planar graph with approximately known edge lengths, recover the Euclidean position of each vertex up to a global rotation and translation. This formulation is applicable
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 366 (9 self)
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
A Technique for Drawing Directed Graphs
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1993
"... We describe a fourpass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce cros ..."
Abstract

Cited by 252 (18 self)
 Add to MetaCart
We describe a fourpass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce
RMAT: A recursive model for graph mining
 In Fourth SIAM International Conference on Data Mining (SDM’ 04
, 2004
"... How does a ‘normal ’ computer (or social) network look like? How can we spot ‘abnormal ’ subnetworks in the Internet, or web graph? The answer to such questions is vital for outlier detection (terrorist networks, or illegal moneylaundering rings), forecasting, and simulations (“how will a computer ..."
Abstract

Cited by 245 (17 self)
 Add to MetaCart
computer virus spread?”). The heart of the problem is finding the properties of real graphs that seem to persist over multiple disciplines. We list such “laws ” and, more importantly, we propose a simple, parsimonious model, the “recursive matrix ” (RMAT) model, which can quickly generate realistic graphs
Network Robustness and Fragility: Percolation on Random Graphs.
 Physical Review Letters
, 2000
"... Recent work on the Internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes or links. Such deletions include, for example, the failure of Internet routers or power transmission lines. Percolation models on ra ..."
Abstract

Cited by 211 (3 self)
 Add to MetaCart
on random graphs provide a simple representation of this process but have typically been limited to graphs with Poisson degree distribution at their vertices. Such graphs are quite unlike realworld networks, which often possess powerlaw or other highly skewed degree distributions. In this paper we study
Approximate distance oracles
, 2004
"... Let G = (V, E) be an undirected weighted graph with V  = n and E  = m. Let k ≥ 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn 1/k) expected time, constructing a data structure of size O(kn 1+1/k), such that any subsequent distance query can be answered, approximately, in ..."
Abstract

Cited by 273 (9 self)
 Add to MetaCart
Let G = (V, E) be an undirected weighted graph with V  = n and E  = m. Let k ≥ 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn 1/k) expected time, constructing a data structure of size O(kn 1+1/k), such that any subsequent distance query can be answered, approximately
Conditions For Unique Graph Realizations
 SIAM J. Comput
, 1992
"... . The graph realization problem is that of computing the relative locations of a set of vertices placed in Euclidean space, relying only upon some set of intervertex distance measurements. This paper is concerned with the closely related problem of determining whether or not a graph has a unique re ..."
Abstract

Cited by 155 (1 self)
 Add to MetaCart
. The graph realization problem is that of computing the relative locations of a set of vertices placed in Euclidean space, relying only upon some set of intervertex distance measurements. This paper is concerned with the closely related problem of determining whether or not a graph has a unique
PerformanceEffective and LowComplexity Task Scheduling for Heterogeneous Computing
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2002
"... Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NPcomplete in general cases as well as in several restricted cases. Because of its key importance, this problem has been exte ..."
Abstract

Cited by 255 (0 self)
 Add to MetaCart
with the related work, a parametric graph generator was designed to generate weighted directed acyclic graphs with various characteristics. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithms significantly surpass previous
Results 1  10
of
2,191