Sciweavers

867 search results - page 112 / 174
» Network Robustness and Graph Topology
Sort
View
BMCBI
2008
96views more  BMCBI 2008»
13 years 8 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
CLUSTER
2002
IEEE
13 years 7 months ago
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
BMCBI
2008
138views more  BMCBI 2008»
13 years 8 months ago
CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 2 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
MOBIHOC
2002
ACM
14 years 7 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter