Sciweavers

2432 search results - page 122 / 487
» Degrees and choice numbers
Sort
View
SODA
2004
ACM
160views Algorithms» more  SODA 2004»
15 years 7 months ago
On colorings of squares of outerplanar graphs
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
Geir Agnarsson, Magnús M. Halldórsso...
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
15 years 7 months ago
Coloring powers of planar graphs
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
Geir Agnarsson, Magnús M. Halldórsso...
JSAC
2006
100views more  JSAC 2006»
15 years 6 months ago
An improved algorithm for optimal lightpath establishment on a tree topology
Routing and wavelength assignment (RWA) aims to assign the limited number of wavelengths in a wavelength-division multiplexed (WDM) optical network so as to achieve greater capacit...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
DCC
2011
IEEE
15 years 1 months ago
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 12 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...