5922 search results - page 365 / 1185 » Navigability of Complex Networks |
149
click to vote
APPINF
2003
15 years 5 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
146
click to vote
ISSE
2006
15 years 4 months ago
2006
Providing and managing security for large networked systems is difficult because their size and complexity makes manual design and management nearly impossible. Current security m...
175
click to vote
OL
2011
14 years 11 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
132
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
148
click to vote
ICPADS
2007
IEEE
15 years 10 months ago
2007
IEEE
Protecting personal privacy and energy efficiency are two primary concerns for mobile ad hoc networks. However, no energy-efficient multicast algorithm designed for preserving ano...