412 search results - page 2 / 83 » Single-Sink Network Design with Vertex Connectivity Requirem... |
137
click to vote
MOR
2007
15 years 5 days ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
118
Voted
HIS
2009
14 years 10 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
125
Voted
EDBT
2012
ACM
13 years 3 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
89
Voted
JAL
2002
15 years 10 days ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
103
Voted
PERCOM
2007
ACM
16 years 7 days ago
2007
ACM
Interest in extracting and exploiting information from wireless sensor networks has been increasing for several years. Most scenarios focus on collecting and evaluating large amoun...