1992
DOI: 10.1016/0196-6774(92)90061-g
|View full text |Cite
|
Sign up to set email alerts
|

Randomized online graph coloring

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0

Year Published

1994
1994
2013
2013

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 53 publications
(28 citation statements)
references
References 2 publications
0
28
0
Order By: Relevance
“…Also, it would be interesting to investigate whether randomization helps in improving the known upper bounds and even beating the lower bounds for deterministic algorithms. To our knowledge, randomized online coloring algorithms have not been studied except for very general classes of graphs (e.g., in [16]) where the results are much weaker than those for disk graphs.…”
Section: Open Problemsmentioning
confidence: 99%
See 1 more Smart Citation
“…Also, it would be interesting to investigate whether randomization helps in improving the known upper bounds and even beating the lower bounds for deterministic algorithms. To our knowledge, randomized online coloring algorithms have not been studied except for very general classes of graphs (e.g., in [16]) where the results are much weaker than those for disk graphs.…”
Section: Open Problemsmentioning
confidence: 99%
“…For checking whether a new node presented has 16 or more non-overlapping disks of some layer in its neighborhood may require time Ω(n 16 ). This could be decreased to Ω(n 8 ) by changing the constraint so that a disk cannot be classified into a layer if it overlaps with at least 8 mutually non-overlapping disks belonging to this layer.…”
Section: The Upper Boundmentioning
confidence: 99%
“…3 The links are then colored via distributed randomized coloring [27], where two links i and j are allocated a different color if i ∈ C j or j ∈ C i . This results in each link having a color or a preferred sub-band, m …”
Section: Resource Selectionmentioning
confidence: 99%
“…Vishwanathan [Vis90] presents an algorithm for such a model that uses a number of colors within a logarithmic factor of the Wigderson bound.…”
Section: Past Workmentioning
confidence: 99%