Results 1  10
of
2,536
AllPairs Bottleneck Paths in Vertex Weighted Graphs
 In Proc. of SODA, 978–985
, 2007
"... Let G = (V, E, w) be a directed graph, where w: V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u, v the bottleneck weight, or the capacity, from u to v, denoted c(u, v), ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
), is the maximum bottleneck weight of a path from u to v. In the AllPairs Bottleneck Paths (APBP) problem we have to find the bottleneck weights for all ordered pairs of vertices. Our main result is an O(n 2.575) time algorithm for the APBP problem. The exponent is derived from the exponent of fast matrix
AllPairs Bottleneck Paths For General Graphs in Truly SubCubic Time
 STOC'07
, 2007
"... In the allpairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real nonnegative capacities on its edges and is asked to determine, for all pairs of vertices s and t, the capacity of a single path for which a maximum amount of flow can b ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
In the allpairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real nonnegative capacities on its edges and is asked to determine, for all pairs of vertices s and t, the capacity of a single path for which a maximum amount of flow can
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems?
"... Abstract. We introduce a new problem that combines the well known All Pairs Shortest Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to compute the shortest paths for all pairs of vertices for all possible flow amounts. We call this new problem the All Pairs Shortest Paths for ..."
Abstract
 Add to MetaCart
Abstract. We introduce a new problem that combines the well known All Pairs Shortest Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to compute the shortest paths for all pairs of vertices for all possible flow amounts. We call this new problem the All Pairs Shortest Paths
All Pairs Bottleneck Paths and MaxMin Matrix Products in Truly Subcubic Time
, 2009
"... In the all pairs bottleneck paths (APBP) problem, one is given a directed graph with real weights on its edges. Viewing the weights as capacities, one is asked to determine, for all pairs (s,t) of vertices, the maximum amount of flow that can be routed along a single path from s to t. The APBP pro ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In the all pairs bottleneck paths (APBP) problem, one is given a directed graph with real weights on its edges. Viewing the weights as capacities, one is asked to determine, for all pairs (s,t) of vertices, the maximum amount of flow that can be routed along a single path from s to t. The APBP
On the ComparisonAddition Complexity of AllPairs Shortest Paths
 In Proc. 13th Int'l Symp. on Algorithms and Computation (ISAAC'02
, 2002
"... We present an allpairs shortest path algorithm for arbitrary graphs that performs O(mn log (m; n)) comparison and addition operations, where m and n are the number of edges and vertices, resp., and is Tarjan's inverseAckermann function. Our algorithm eliminates the sorting bottleneck inherent ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
We present an allpairs shortest path algorithm for arbitrary graphs that performs O(mn log (m; n)) comparison and addition operations, where m and n are the number of edges and vertices, resp., and is Tarjan's inverseAckermann function. Our algorithm eliminates the sorting bottleneck
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
in the problem graph: ( 1) O(n log n + m) for the singlesource shortest path problem with nonnegative edge lengths, improved from O(m logfmh+2)n); (2) O(n*log n + nm) for the allpairs shortest path problem, improved from O(nm lo&,,,+2,n); (3) O(n*logn + nm) for the assignment problem (weighted bipartite
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 657 (27 self)
 Add to MetaCart
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route
EndtoEnd Internet Packet Dynamics,”
 Proc. SIGCOMM '97,
, 1997
"... Abstract We discuss findings from a largescale study of Internet packet dynamics conducted by tracing 20,000 TCP bulk transfers between 35 Internet sites. Because we traced each 100 Kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the endtoend ..."
Abstract

Cited by 843 (19 self)
 Add to MetaCart
toend behaviors due to the different directions of the Internet paths, which often exhibit asymmetries. We characterize the prevalence of unusual network events such as outoforder delivery and packet corruption; discuss a robust receiverbased algorithm for estimating "bottleneck bandwidth
Random Key Predistribution Schemes for Sensor Networks”,
 IEEE Symposium on Security and Privacy,
, 2003
"... Abstract Efficient key distribution is the basis for providing secure communication, a necessary requirement for many emerging sensor network applications. Many applications require authentic and secret communication among neighboring sensor nodes. However, establishing keys for secure communicatio ..."
Abstract

Cited by 832 (12 self)
 Add to MetaCart
keys for all pairs of nodes is not viable due to the large number of sensors and the limited memory of sensor nodes. A new key distribution approach was proposed by Eschenauer and Gligor [11] to achieve secrecy for nodetonode communication: sensor nodes receive a random subset of keys from a key pool
Results 1  10
of
2,536