153 search results - page 15 / 31 » Edge Disjoint Paths in Moderately Connected Graphs |
65
Voted
SIAMDM
2010
14 years 4 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
ICPPW
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract— In order to provide reliable connections across metropolitan and wide-area optical networks, the network operator must provide some degree of redundancy so that traffic...
CCCG
2009
14 years 10 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
86
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...