Sciweavers

2310 search results - page 442 / 462
» Coloring Random Graphs
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 29 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
BMCBI
2006
101views more  BMCBI 2006»
13 years 7 months ago
Hierarchical modularity of nested bow-ties in metabolic networks
Background: The exploration of the structural topology and the organizing principles of genomebased large-scale metabolic networks is essential for studying possible relations bet...
Jing Zhao, Hong Yu, Jianhua Luo, Zhi-Wei Cao, Yi-X...
BMCBI
2007
115views more  BMCBI 2007»
13 years 7 months ago
Correlation between structure and temperature in prokaryotic metabolic networks
Background: In recent years, an extensive characterization of network structures has been made in an effort to elucidate design principles of metabolic networks, providing valuabl...
Kazuhiro Takemoto, Jose C. Nacher, Tatsuya Akutsu
TPDS
2010
109views more  TPDS 2010»
13 years 6 months ago
Distributed Network Formation for n-Way Broadcast Applications
—In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n À 1 destinations as well as download their respecti...
Georgios Smaragdakis, Nikolaos Laoutaris, Pietro M...