Results 1  10
of
1,895,812
EdgeDisjoint Paths in Expander Graphs
, 2000
"... Given a graph G = (V, E) and a set of n pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of n paths so found is edgedisjoint. (For arbitrary graphs the problem is AfPcomplete, although it is in 7 > if n is fixed.) We ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
Given a graph G = (V, E) and a set of n pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of n paths so found is edgedisjoint. (For arbitrary graphs the problem is AfPcomplete, although it is in 7 > if n is fixed.) We
Greedy EdgeDisjoint Paths in Complete Graphs
, 2001
"... The maximum edgedisjoint path problem (MEDP) is one of the most classical NPhard problems [5]. We consider MEDP in complete graphs. ErlebachVukadinovi'c [4] showed that MEDP in complete graphs is NPhard and has a constantfactor approximation algorithm. A recent work [9] by KolmanScheidel ..."
Abstract
 Add to MetaCart
The maximum edgedisjoint path problem (MEDP) is one of the most classical NPhard problems [5]. We consider MEDP in complete graphs. ErlebachVukadinovi'c [4] showed that MEDP in complete graphs is NPhard and has a constantfactor approximation algorithm. A recent work [9] by Kolman
Greedy EdgeDisjoint Paths in Complete Graphs
, 2003
"... The maximum edgedisjoint paths problem (MEDP) is one of the most classical NPhard problems. We study the approximation ratio of a simple and practical approximation algorithm, the shortestpathfirst greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio is a ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The maximum edgedisjoint paths problem (MEDP) is one of the most classical NPhard problems. We study the approximation ratio of a simple and practical approximation algorithm, the shortestpathfirst greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio
Edgedisjoint paths in planar graphs with constant congestion
 IN PROCEEDINGS OF THE 38TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2006
, 2009
"... We study the maximum edgedisjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2,..., sktk, the goal is to maximize the number of demands that can be connected (routed) by edgedisjoint paths. The natural multicommodity flow relaxation has an Ω ( √ ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We study the maximum edgedisjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2,..., sktk, the goal is to maximize the number of demands that can be connected (routed) by edgedisjoint paths. The natural multicommodity flow relaxation has an Ω
Existence and Construction of EdgeDisjoint Paths on Expander Graphs
"... Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of q paths so found is edgedisjoint. (For general graphs the related decision problem is NPcomplete.) We prove suffic ..."
Abstract
 Add to MetaCart
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of q paths so found is edgedisjoint. (For general graphs the related decision problem is NPcomplete.) We prove
EDGEDISJOINT HAMILTON CYCLES IN GRAPHS
, 2009
"... In this paper we give an approximate answer to a question of NashWilliams from 1970: we show that for every α> 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 + α)n contains at least n/8 edgedisjoint Hamilton cycles. More generally, we give an asymptotically b ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
In this paper we give an approximate answer to a question of NashWilliams from 1970: we show that for every α> 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 + α)n contains at least n/8 edgedisjoint Hamilton cycles. More generally, we give an asymptotically
Abstract EdgeDisjoint Paths in Expander Graphs
"... Given a graph G = (17, E) and a set of t ¢ pairs of vertices in V, we are interested in finding for each pair (hi, b~), a path connecting ai to bi, such that the set of t ¢ paths so found is edgedisjoint. (For arbitrary graphs the problem is AfT~complete, although it is in 7 ~ if n is fixed.) We p ..."
Abstract
 Add to MetaCart
Given a graph G = (17, E) and a set of t ¢ pairs of vertices in V, we are interested in finding for each pair (hi, b~), a path connecting ai to bi, such that the set of t ¢ paths so found is edgedisjoint. (For arbitrary graphs the problem is AfT~complete, although it is in 7 ~ if n is fixed.) We
Edgedisjoint Paths in Graphs on Surfaces
"... We present a survey of results on the edgedisjoint paths problem and relate this problem to the edgedisjoint homotopic path and the edgedisjoint homotopic cycle problem. The latter problem is: given a graph G =(V � E) embedded on a surface S and closed curves C1�:::�Ck on S, nd necessary and su c ..."
Abstract
 Add to MetaCart
We present a survey of results on the edgedisjoint paths problem and relate this problem to the edgedisjoint homotopic path and the edgedisjoint homotopic cycle problem. The latter problem is: given a graph G =(V � E) embedded on a surface S and closed curves C1�:::�Ck on S, nd necessary and su
EDGE–DISJOINT PATHS IN PERMUTATION GRAPHS
"... In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(V + E)) algorithm to s ..."
Abstract
 Add to MetaCart
In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(V + E)) algorithm
Wiring EdgeDisjoint Layouts
, 1996
"... We consider the wiring or layer assignment problem for edgedisjoint layouts. The wiring problem is well understood for the case that the underlying layout graph is a square grid (see [8]). In this paper, we introduce a more general approach to this problem. For an edgedisjoint layout in the plane ..."
Abstract
 Add to MetaCart
We consider the wiring or layer assignment problem for edgedisjoint layouts. The wiring problem is well understood for the case that the underlying layout graph is a square grid (see [8]). In this paper, we introduce a more general approach to this problem. For an edgedisjoint layout in the plane
Results 1  10
of
1,895,812