27 search results - page 2 / 6 » On Network Survivability Algorithms Based on Trellis Graph T... |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
BROADNETS
2004
IEEE
13 years 8 months ago
2004
IEEE
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
SYNASC
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...