Sciweavers

11381 search results - page 57 / 2277
» Connectivity
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 9 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
FSTTCS
2010
Springer
14 years 7 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
IPPS
2010
IEEE
14 years 7 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal

Publication
156views
16 years 8 months ago
On Determining the Fair Bandwidth Share for ABR Connections in ATM Networks
In a multi-service network such as ATM, adaptive data services ( such as ABR) share the bandwidth left unused by higher priority services. The network indicates to the ABR sources ...
Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Roh...
WWW
2006
ACM
15 years 10 months ago
Why is connectivity in developing regions expensive: policy challenges more than technical limitations?
I present analysis examining some of the causes of poor connectivity in developing countries. Based on a technoeconomic analysis and design, I show that technical limitations per ...
Rahul Tongia