Sciweavers

3757 search results - page 17 / 752
» The overlap number of a graph
Sort
View
ARSCOM
2007
63views more  ARSCOM 2007»
13 years 8 months ago
Towards a Characterisation of Lottery Set Overlapping Structures
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuu...
DM
2008
177views more  DM 2008»
13 years 8 months ago
The independence number in graphs of maximum degree three
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...
FAW
2009
Springer
180views Algorithms» more  FAW 2009»
14 years 3 months ago
Edge Search Number of Cographs in Linear Time
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
Pinar Heggernes, Rodica Mihai
ICC
2009
IEEE
103views Communications» more  ICC 2009»
14 years 3 months ago
On the Minimum k-Connectivity Repair in Wireless Sensor Networks
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...
Hisham M. Almasaeid, Ahmed E. Kamal
WICON
2008
13 years 9 months ago
Channel assignment with partially overlapping channels in wireless mesh networks
Many efforts have been devoted to maximizing the network throughput with limited channel resources in multi-radio multi-channel wireless mesh networks. It has been believed that t...
Yong Ding, Yi Huang, Guo-Kai Zeng, Li Xiao