Sciweavers

1493 search results - page 3 / 299
» Local resilience of graphs
Sort
View
TON
2012
11 years 8 months ago
Independent Directed Acyclic Graphs for Resilient Multipath Routing
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
Sangman Cho, Theodore Elhourani, Srinivasan Ramasu...
SIAMDM
2010
91views more  SIAMDM 2010»
13 years 4 months ago
Resilient Pancyclicity of Random and Pseudorandom Graphs
Michael Krivelevich, Choongbum Lee, Benny Sudakov
ICML
2008
IEEE
14 years 6 months ago
Graph transduction via alternating minimization
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
Jun Wang, Tony Jebara, Shih-Fu Chang
EDCC
2005
Springer
13 years 11 months ago
Structure-Based Resilience Metrics for Service-Oriented Networks
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Ja...
SIGMETRICS
2005
ACM
13 years 11 months ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
Derek Leonard, Vivek Rai, Dmitri Loguinov