Sciweavers

92 search results - page 3 / 19
» Bottleneck Domination and Bottleneck Independent Domination ...
Sort
View
RSA
2002
66views more  RSA 2002»
13 years 7 months ago
Minimum independent dominating sets of random cubic graphs
William Duckworth, Nicholas C. Wormald
ADHOC
2007
135views more  ADHOC 2007»
13 years 7 months ago
Mitigating the gateway bottleneck via transparent cooperative caching in wireless mesh networks
Wireless mesh networks (WMNs) have been proposed to provide cheap, easily deployable and robust Internet access. The dominant Internet-access traffic from clients causes a congest...
Saumitra M. Das, Himabindu Pucha, Y. Charlie Hu
DM
1998
100views more  DM 1998»
13 years 7 months ago
Upper domination and upper irredundance perfect graphs
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
Gregory Gutin, Vadim E. Zverovich
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
13 years 12 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito