Sciweavers

117 search results - page 19 / 24
» Minimizing the Diameter of a Network Using Shortcut Edges
Sort
View
ICC
2011
IEEE
201views Communications» more  ICC 2011»
12 years 7 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
AINA
2005
IEEE
14 years 1 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko
JCO
2010
101views more  JCO 2010»
13 years 6 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
GG
2004
Springer
14 years 27 days ago
Analysis of Metabolic Pathways by Graph Transformation
Biochemical pathways, such as metabolic, regulatory, and signal transduction pathways, constitute complex networks of functional and physical interactions between molecular species...
Francesc Rosselló, Gabriel Valiente
CONEXT
2007
ACM
13 years 11 months ago
Fair and efficient scheduling in data ferrying networks
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologi...
Shimin Guo, Srinivasan Keshav