63 search results - page 1 / 13 » Constructing vertex-disjoint paths in (n, k)-star graphs |
JCT
2006
13 years 4 months ago
2006
An (n, N)
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
ICALP
2010
Springer
13 years 8 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
NETWORKS
2007
13 years 4 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...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...