Sciweavers

75 search results - page 7 / 15
» Topological Tree Clustering of Social Network Search Results
Sort
View
INFOSCALE
2006
ACM
14 years 2 months ago
A generic search strategy for large-scale real-world networks
— We consider the following situation for a given large-scale network: Starting from an initial node we move to its neighbor node and repeat that until reaching a target node. Ho...
Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kuni...
HUMAN
2003
Springer
14 years 2 months ago
A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
Gunyoung Koh, Duyoung Oh, Heekyoung Woo
ICDCSW
2003
IEEE
14 years 2 months ago
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
Qing Dai, Jie Wu
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 2 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
BMCBI
2010
156views more  BMCBI 2010»
13 years 9 months ago
Protein complex prediction via verifying and reconstructing the topology of domain-domain interactions
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
Yosuke Ozawa, Rintaro Saito, Shigeo Fujimori, Hisa...