Sciweavers

646 search results - page 121 / 130
» Generalized connected domination in graphs
Sort
View
MOBICOM
2003
ACM
14 years 1 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
SAC
2003
ACM
14 years 1 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
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...
Günther R. Raidl, Bryant A. Julstrom
BMCBI
2007
93views more  BMCBI 2007»
13 years 8 months ago
The topology of metabolic isotope labeling networks
Background: Metabolic Flux Analysis (MFA) based on isotope labeling experiments (ILEs) is a widely established tool for determining fluxes in metabolic pathways. Isotope labeling ...
Michael Weitzel, Wolfgang Wiechert, Katharina N&ou...
WWW
2009
ACM
14 years 9 months ago
An experimental study of large-scale mobile social network
Mobile social network is a typical social network where one or more individuals of similar interests or commonalities, conversing and connecting with one another using the mobile ...
Zheng-Bin Dong, Guo-Jie Song, Kun-Qing Xie, Jing-Y...
PODC
2009
ACM
14 years 9 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher