153 search results - page 6 / 31 » Edge Disjoint Paths in Moderately Connected Graphs |
108
click to vote
ENDM
2008
14 years 11 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
126
click to vote
APPROX
2000
Springer
15 years 3 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
107
click to vote
NETWORKS
2007
14 years 11 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
113
click to vote
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
JCO
2006
14 years 11 months ago
2006
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...