Sciweavers

1972 search results - page 62 / 395
» connection 2008
Sort
View
CORR
2008
Springer
174views Education» more  CORR 2008»
15 years 25 days ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...
84
Voted
DM
2006
64views more  DM 2006»
15 years 23 days ago
Path extendability of claw-free graphs
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
Yu Sheng, Feng Tian, Jianglu Wang, Bing Wei, Yongj...
87
Voted
COCOON
2008
Springer
15 years 2 months ago
Dimensions of Points in Self-similar Fractals
We use nontrivial connections between the theory of computing and the finescale geometry of Euclidean space to give a complete analysis of the dimensions of individual points in f...
Jack H. Lutz, Elvira Mayordomo
SEFM
2008
IEEE
15 years 7 months ago
Restricted Broadcast Process Theory
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...
Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar
98
Voted
DM
2008
95views more  DM 2008»
15 years 24 days ago
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Mas...