3204 search results - page 389 / 641 » The b-chromatic Number of a Graph |
194
click to vote
DIALM
2003
ACM
16 years 13 hour ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
148
click to vote
MP
2002
15 years 6 months ago
2002
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
174
click to vote
TPDS
1998
15 years 6 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
201
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
190
click to vote
JCT
2010
15 years 5 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...