Sciweavers

3204 search results - page 210 / 641
» The b-chromatic Number of a Graph
Sort
View
CPC
2007
125views more  CPC 2007»
13 years 10 months ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
RSA
2006
66views more  RSA 2006»
13 years 10 months ago
Regular graphs whose subgraphs tend to be acyclic
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
Noga Alon, Eitan Bachmat
JCO
2007
113views more  JCO 2007»
13 years 10 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
Jerrold R. Griggs, Xiaohua Teresa Jin
AUTOMATICA
2004
147views more  AUTOMATICA 2004»
13 years 10 months ago
Interval analysis and dioid: application to robust controller design for timed event graphs
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenc...
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 8 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer