Sciweavers

1986 search results - page 360 / 398
» Path Separability of Graphs
Sort
View
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 2 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
INFOCOM
2008
IEEE
14 years 2 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
14 years 1 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
DSN
2006
IEEE
14 years 1 months ago
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
Antonio Fernández, Ernesto Jiménez, ...
SIGMETRICS
2006
ACM
14 years 1 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