Sciweavers

1512 search results - page 3 / 303
» connection 2006
Sort
View
113
Voted
COMBINATORICS
2004
82views more  COMBINATORICS 2004»
15 years 29 days ago
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
R. Bruce Richter
98
Voted
JOC
2006
71views more  JOC 2006»
15 years 1 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...
IOR
2006
44views more  IOR 2006»
15 years 1 months ago
Optimal Selection of a Connected Reserve Network
Hayri Önal, Robert A. Briers
64
Voted
JCSS
2006
40views more  JCSS 2006»
15 years 1 months ago
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Lisa Fleischer, Kamal Jain, David P. Williamson