745 search results - page 106 / 149 » On Generating Random Network Structures: Connected Graphs |
105
click to vote
BIRD
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We propose a computational method for reconstructing metabolic networks. The method utilizes optimization techniques and graph traversal algorithms to discover a set of b...
119
Voted
GD
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
130
Voted
SAC
2003
ACM
15 years 5 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
110
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Spiking neural networks are computationally more powerful than conventional artificial neural networks. Although this fact should make them especially desirable for use in evoluti...
113
click to vote
MOBIHOC
2008
ACM
16 years 4 days ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...