Sciweavers

2354 search results - page 26 / 471
» Radio number for trees
Sort
View
74
Voted
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
14 years 11 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
DAM
1999
105views more  DAM 1999»
14 years 9 months ago
The b-chromatic Number of a Graph
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
Robert W. Irving, David Manlove
ARSCOM
2002
70views more  ARSCOM 2002»
14 years 9 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...
LICS
2007
IEEE
15 years 4 months ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis
IJACTAICIT
2010
185views more  IJACTAICIT 2010»
14 years 7 months ago
Adaptive Bandwidth Allocation Scheme for Cognitive Radios
In recent past, cognitive radio has come out to as a promising solution to the spectrum scarcity problem. It tends to increase the spectrum utilization by making use of underutili...
Prabhjot Kaur, Moin Uddin, Arun Khosla