Sciweavers

11381 search results - page 170 / 2277
» Connectivity
Sort
View
124
Voted
JGT
2007
68views more  JGT 2007»
15 years 3 months ago
Forcing highly connected subgraphs
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
Maya Jakobine Stein
JMM
2007
107views more  JMM 2007»
15 years 3 months ago
Using a Spatial Context Authentication Proxy for Establishing Secure Wireless Connections
Spontaneous interaction in wireless ad-hoc networks is often desirable not only between users or devices in direct contact, but also with devices that are accessible only via a wi...
Rene Mayrhofer, Roswitha Gostner
144
Voted
JPDC
2007
112views more  JPDC 2007»
15 years 3 months ago
Distributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
Rajiv Gandhi, Srinivasan Parthasarathy 0002
155
Voted
JPDC
2007
191views more  JPDC 2007»
15 years 3 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
143
Voted
IWC
2002
98views more  IWC 2002»
15 years 3 months ago
Living memory: agent-based information management for connected local communities
We investigate the application of multi-agent systems to develop intelligent information interfaces for connected communities, a class of computer applications aimed at enhancing ...
Kostas Stathis, Oscar de Bruijn, Silvio Macedo