Sciweavers

11381 search results - page 56 / 2277
» Connectivity
Sort
View
JCT
2011
86views more  JCT 2011»
14 years 4 months ago
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu
ECCV
2006
Springer
15 years 11 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother
AIRWEB
2009
Springer
15 years 4 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
SIGMETRICS
2006
ACM
15 years 3 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
CANPC
2000
Springer
15 years 2 months ago
Transparent Network Connectivity in Dynamic Cluster Environments
Improvements in microprocessor and networking performance have made networks of workstations a very attractive platform for high-end parallel and distributed computing. However, t...
Xiaodong Fu, Hua Wang, Vijay Karamcheti