Results 1  10
of
1,054,725
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
The Maximum EdgeDisjoint Paths Problem In Bidirected Trees
 SIAM Journal on Discrete Mathematics
, 1998
"... . A bidirected tree is the directed graph obtained from an undirected tree by replacing each undirected edge by two directed edges with opposite directions. Given a set of directed paths in a bidirected tree, the goal of the maximum edgedisjoint paths problem is to select a maximumcardinality subse ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
. A bidirected tree is the directed graph obtained from an undirected tree by replacing each undirected edge by two directed edges with opposite directions. Given a set of directed paths in a bidirected tree, the goal of the maximum edgedisjoint paths problem is to select a maximumcardinality
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
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 Ω
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
Edgedisjoint st Paths on Probabilistic Graphs
"... For a probabilistic graph $(G=(V, E, s, t),p) $ , where $G $ is an undirected graph with specified source vertex $s $ and sink vertex $t(s\neq t) $ in which each edge has independent failure probability and each vertex is assumed to be failurefree, and $p=(p(e_{1}), \ldots, p(e_{E})) $ is a vecto ..."
Abstract
 Add to MetaCart
vector consisting of failure probabilities $p(e;)s $ of all edges $e_{i}s $ in $E $ , we consider the problem of computing the expected maximum number $\Gamma_{(G,p)} $ of edgedisjoint st paths. It has been known that this computing problem is NPhard even if $G $ is restricted to several classes like
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
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
Results 1  10
of
1,054,725