3204 search results - page 357 / 641 » The b-chromatic Number of a Graph |
197
click to vote
ENDM
2002
15 years 6 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
263
click to vote
ICDE
2000
IEEE
16 years 8 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
204
click to vote
SECON
2007
IEEE
16 years 1 months ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
189
click to vote
TMC
2008
15 years 6 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
238
click to vote
DIALM
2003
ACM
16 years 1 days ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...