1986 search results - page 360 / 398 » Path Separability of Graphs |
177
click to vote
ESA
2009
Springer
16 years 15 days ago
2009
Springer
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...
163
Voted
INFOCOM
2008
IEEE
16 years 10 days ago
2008
IEEE
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 ...
161
click to vote
ATVA
2007
Springer
16 years 3 days ago
2007
Springer
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...
180
click to vote
DSN
2006
IEEE
15 years 12 months ago
2006
IEEE
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...
162
click to vote
SIGMETRICS
2006
ACM
15 years 12 months ago
2006
ACM
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...