Results 1  10
of
28
Applying parallel computation algorithms in the design of serial algorithms
 J. ACM
, 1983
"... Abstract. The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multiprocessor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for design ..."
Abstract

Cited by 253 (7 self)
 Add to MetaCart
(Show Context)
Abstract. The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multiprocessor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing an efficient serial algorithm for another problem. A d ~ eframework d for cases like this is presented. Particular cases, which are discussed in this paper, provide motivation for examining parallelism in sorting, selection, minimumspanningtree, shortest route, maxflow, and matrix multiplication problems, as well as in scheduling and locational problems.
All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication
 Journal of the ACM
, 2000
"... We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms. The first algorithm solves... ..."
Abstract

Cited by 88 (6 self)
 Add to MetaCart
(Show Context)
We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms. The first algorithm solves...
On the exponent of the all pairs shortest path problem
"... The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even for t ..."
Abstract

Cited by 86 (2 self)
 Add to MetaCart
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even for the very special case of directed graphs with uniform edge lengths. In this paper we give an algorithm of time O � n ν log 3 n � , ν = (3 + ω)/2, for the case of edge lengths in {−1, 0, 1}. Thus, for the current known bound on ω, we get a bound on the exponent, ν < 2.688. In case of integer edge lengths with absolute value bounded above by M, the time bound is O � (Mn) ν log 3 n � and the exponent is less than 3 for M = O(n α), for α < 0.116 and the current bound on ω.
Fast Approximation of Centrality
 Journal of Graph Algorithms and Applications
, 2001
"... Social studies researchers use graphs to model group activities in social networks. An important property in this context is the centrality of a vertex: the inverse of the average distance to each other vertex. We describe a randomized approximation algorithm for centrality in weighted graphs. For g ..."
Abstract

Cited by 53 (0 self)
 Add to MetaCart
(Show Context)
Social studies researchers use graphs to model group activities in social networks. An important property in this context is the centrality of a vertex: the inverse of the average distance to each other vertex. We describe a randomized approximation algorithm for centrality in weighted graphs. For graphs exhibiting the small world phenomenon, our method estimates the centrality of all vertices with high probability within a (1 + #) factor in nearlinear time. 1 Introduction In social network analysis, the vertices of a graph represent agents in a group and the edges represent relationships, such as communication or friendship. The idea of applying graph theory to analyze the connection between the structural centrality and group process was introduced by Bavelas [4]. Various measurement of centrality [7, 14, 15] have been proposed for analyzing communication activity, control, or independence within a social network. We are particularly interested in closeness centrality [5, 6, 24]...
Determinant sums for undirected hamiltonicity
 in Prof. of FOCS’10, 2010
"... We present a Monte Carlo algorithm for Hamiltonicity detection in an nvertex undirected graph running in O ∗ (1.657 n) time. To the best of our knowledge, this is the first superpolynomial improvement on the worst case runtime for the problem since the O ∗ (2 n) bound established for TSP almost fif ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
(Show Context)
We present a Monte Carlo algorithm for Hamiltonicity detection in an nvertex undirected graph running in O ∗ (1.657 n) time. To the best of our knowledge, this is the first superpolynomial improvement on the worst case runtime for the problem since the O ∗ (2 n) bound established for TSP almost fifty years ago (Bellman 1962, Held and Karp 1962). It answers in part the first open problem in Woeginger’s 2003 survey on exact algorithms for NPhard problems. For bipartite graphs, we improve the bound to O ∗ (1.414 n) time. Both the bipartite and the general algorithm can be implemented to use space polynomial in n. We combine several recently resurrected ideas to get the results. Our main technical contribution is a new reduction inspired by the algebraic sieving method for kPath (Koutis ICALP 2008, Williams IPL 2009). We introduce the Labeled Cycle Cover Sum in which weareset tocount weightedarclabeled cycle coversoverafinite field ofcharacteristic two. We reduce Hamiltonicity to Labeled Cycle Cover Sum and apply the determinant summation technique for Exact Set Covers (Björklund STACS 2010) to evaluate it. 1
Subcubic Equivalences Between Path, Matrix, and Triangle Problems
"... We say an algorithm on n × n matrices with entries in [−M,M] (or nnode graphs with edge weights from [−M,M]) is truly subcubic if it runs in O(n 3−δ · poly(log M)) time for some δ> 0. We define a notion of subcubic reducibility, and show that many important problems on graphs and matrices solvab ..."
Abstract

Cited by 42 (11 self)
 Add to MetaCart
(Show Context)
We say an algorithm on n × n matrices with entries in [−M,M] (or nnode graphs with edge weights from [−M,M]) is truly subcubic if it runs in O(n 3−δ · poly(log M)) time for some δ> 0. We define a notion of subcubic reducibility, and show that many important problems on graphs and matrices solvable in O(n 3) time are equivalent under subcubic reductions. Namely, the following weighted problems either all have truly subcubic algorithms, or none of them do: • The allpairs shortest paths problem on weighted digraphs (APSP). • Detecting if a weighted graph has a triangle of negative total edge weight. • Listing up to n 2.99 negative triangles in an edgeweighted graph. • Finding a minimum weight cycle in a graph of nonnegative edge weights. • The replacement paths problem on weighted digraphs. • Finding the second shortest simple path between two nodes in a weighted digraph. • Checking whether a given matrix defines a metric. • Verifying the correctness of a matrix product over the (min,+)semiring. Therefore, if APSP cannot be solved in n 3−ε time for any ε> 0, then many other problems also
All Pairs Shortest Paths in weighted directed graphs  exact and almost exact algorithms
, 1998
"... We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms. The first algorithm solves the APSP problem for weighted directed graphs in which the edge weights are integers of small abso ..."
Abstract

Cited by 41 (6 self)
 Add to MetaCart
We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms. The first algorithm solves the APSP problem for weighted directed graphs in which the edge weights are integers of small absolute value in ~ O(n 2+ ) time, where satisfies the equation !(1; ; 1) = 1 + 2 and !(1; ; 1) is the exponent of the multiplication of an n \Theta n matrix by an n \Theta n matrix. The currently best available bounds on !(1; ; 1), obtained by Coppersmith and Winograd, and by Huang and Pan, imply that ! 0:575. The running time of our algorithm is therefore O(n 2:575 ). Our algorithm improves on the ~ O(n (3+!)=2 ) time algorithm, where ! = !(1; 1; 1) ! 2:376 is the usual exponent of matrix multiplication, obtained by Alon, Galil and Margalit, whose running time is only known to be O(n 2:688 ). The second
Finding, minimizing, and counting weighted subgraphs
 In Proceedings of the FourtyFirst Annual ACM Symposium on the Theory of Computing
, 2009
"... For a pattern graph H on k nodes, we consider the problems of finding and counting the number of (not necessarily induced) copies of H in a given large graph G on n nodes, as well as finding minimum weight copies in both nodeweighted and edgeweighted graphs. Our results include: • The number of cop ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
(Show Context)
For a pattern graph H on k nodes, we consider the problems of finding and counting the number of (not necessarily induced) copies of H in a given large graph G on n nodes, as well as finding minimum weight copies in both nodeweighted and edgeweighted graphs. Our results include: • The number of copies of an H with an independent set of size s can be computed exactly in O ∗ (2 s n k−s+3) time. A minimum weight copy of such an H (with arbitrary real weights on nodes and edges) can be found in O(4 s+o(s) n k−s+3) time. (The O ∗ notation omits poly(k) factors.) These algorithms rely on fast algorithms for computing the permanent of a k × n matrix, over rings and semirings. • The number of copies of any H having minimum (or maximum) nodeweight (with arbitrary real weights on nodes) can be found in O(n ωk/3 + n 2k/3+o(1) ) time, where ω < 2.4 is the matrix multiplication exponent and k is divisible by 3. Similar results hold for other values of k. Also, the number of copies having exactly a prescribed weight can be found within this time. These algorithms extend the technique of Czumaj and Lingas (SODA 2007) and give a new (algorithmic) application of multiparty communication complexity. • Finding an edgeweighted triangle of weight exactly 0 in general graphs requires Ω(n 2.5−ε) time for all ε> 0, unless the 3SUM problem on N numbers can be solved in O(N 2−ε) time. This suggests that the edgeweighted problem is much harder than its nodeweighted version. 1
Finding a maximum weight triangle in n 3−δ time, with applications
 In Proc. of STOC
, 2006
"... We present the first truly subcubic algorithms for finding a maximum nodeweighted triangle in directed and undirected graphs with arbitrary real weights. The first is an O(B · n 3+ω 2) = O(B · n 2.688) deterministic algorithm, where n is the number of nodes, ω is the matrix multiplication exponen ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
(Show Context)
We present the first truly subcubic algorithms for finding a maximum nodeweighted triangle in directed and undirected graphs with arbitrary real weights. The first is an O(B · n 3+ω 2) = O(B · n 2.688) deterministic algorithm, where n is the number of nodes, ω is the matrix multiplication exponent, and B is the number of bits of precision. The second is a strongly polynomial randomized algorithm that runs in O(n 3+ω 2 log n) expected worstcase time. To achieve this, we show how to efficiently sample a weighted triangle uniformly at random, out of just those triangles whose total weight falls in some prescribed interval (W1, W2) for arbitrary weights W1 and W2. Previous approaches to the problem resulted in time bounds with either an exponential dependence on B, or a runtime of the form Ω(n 3 /(log n) c). The algorithms are easily extended to finding a maximum nodeweighted induced subgraph on 3k nodes in Õ(n (3+ω)k 2) = Õ(n2.688k) time. We give applications to a variety of problems, including a stable matching problem between buyers and sellers in computational economics, and discuss the possibility of extending our approach to a truly subcubic algorithm for computing allpairs shortest paths on directed graphs with arbitrary weights. ∗ Both authors were supported by the NSF ALADDIN
Multihoming In Computer Networks: A TopologyDesign Approach
 Computer Networks and ISDN Systems
, 1990
"... Multihoming in networks, i.e., attaching a subscriber to more than a single access point in the network, is a mechanism used to increase several performance criteria. In this paper we take the topological design view and address the problem of finding optimal multihoming configurations for several t ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
Multihoming in networks, i.e., attaching a subscriber to more than a single access point in the network, is a mechanism used to increase several performance criteria. In this paper we take the topological design view and address the problem of finding optimal multihoming configurations for several topological design criteria. We analyze the problem and demonstrate that except for dual homing, multihoming is algorithmically complex. Optimal algorithms based on maximum matching in graphs and 01 integer programming are given for all cases. I. INTRODUCTION Multihoming is a situation in which a network subscriber is attached to more than a single node of the network. It is a useful means of improving a number of performance characteristics. For example, it increases subscribers' availability by protecting both against the crash of his node and sometimes against network partitioning. Another aspect of performance improvement due to multihoming is that messages can be forwarded to a subsc...