Results 1  10
of
2,232
Fast separation in a graph with an excluded minor
, 2005
"... Let G be an nvertex medge graph with weighted vertices. A pair of vertex sets A, B ⊆ V (G) is a 2/3 ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Let G be an nvertex medge graph with weighted vertices. A pair of vertex sets A, B ⊆ V (G) is a 2/3
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
of the algorithm running in O(nm log(n²/m)) time on an nvertex, medge graph. This is as fast as any known method for any graph density and faster on graphs of moderate density. The algorithm also admits efticient distributed and parallel implementations. A parallel implementation running in O(n²log n) time using
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 702 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
Augmenting Undirected Edge Connectivity in ~O (n^2) Time
, 2000
"... We give improved randomized (Monte Carlo) algorithms for undirected edge splitting and edge connectivity augmentation problems. Our algorithms run in time ~ O(n^2) on nvertex graphs, making them an ~\Omega(m/n) factor faster than the best known deterministic ones on medge graphs. ..."
Abstract
 Add to MetaCart
We give improved randomized (Monte Carlo) algorithms for undirected edge splitting and edge connectivity augmentation problems. Our algorithms run in time ~ O(n^2) on nvertex graphs, making them an ~\Omega(m/n) factor faster than the best known deterministic ones on medge graphs.
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
On Universal Cycles of Labeled Graphs
"... A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with m edges, graphs with loops, graphs with multiple edges (with up to m duplications of each ed ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with m edges, graphs with loops, graphs with multiple edges (with up to m duplications of each
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph
, 1989
"... We design the first efficient parallel algorithm for computing the minimal elimination ordering (MEO) of an arbitrary graph. The algorithm works in O(log 3 n) parallel time and O(nm) processors on a CREW PRAM, for an nvertex, medge graph, and is optimal up to a polylogarithmic factor with respec ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
We design the first efficient parallel algorithm for computing the minimal elimination ordering (MEO) of an arbitrary graph. The algorithm works in O(log 3 n) parallel time and O(nm) processors on a CREW PRAM, for an nvertex, medge graph, and is optimal up to a polylogarithmic factor
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
A Faster Algorithm to Recognize EvenHoleFree Graphs
, 2011
"... We study the problem of determining whether an nnode medge graph has an even hole, i.e., an induced simple cycle consisting of an even number of nodes. Conforti, Cornuéjols, Kapoor, and Vuˇsković gave the first polynomialtime algorithm for the problem, which runs in O(n40) time. Later, Chudnovsky ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We study the problem of determining whether an nnode medge graph has an even hole, i.e., an induced simple cycle consisting of an even number of nodes. Conforti, Cornuéjols, Kapoor, and Vuˇsković gave the first polynomialtime algorithm for the problem, which runs in O(n40) time. Later
Fast constructions of lightweight spanners for general graphs
 In Proc. of 24th SODA
, 2013
"... Since the pioneering works of Peleg and Schäffer [32], Althöfer et al. [4], and Chandra et al. [13], it is known that for every weighted undirected nvertex medge graph G = (V, E), and every integer k ≥ 1, there exists a ((2k −1) ·(1+ǫ))spanner with O(n 1+1/k) edges and weight O(k · n 1/k) · ω(MS ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Since the pioneering works of Peleg and Schäffer [32], Althöfer et al. [4], and Chandra et al. [13], it is known that for every weighted undirected nvertex medge graph G = (V, E), and every integer k ≥ 1, there exists a ((2k −1) ·(1+ǫ))spanner with O(n 1+1/k) edges and weight O(k · n 1/k) · ω
Results 1  10
of
2,232