Greedy algorithms for dynamic graph coloring

Ouerfelli, Linda; Bouziri, Hend

doi:10.1109/ccca.2011.6031437

Cited by 22 publications

(13 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The problem of maintaining a coloring of a graph that evolves over time has been tackled before, but to our knowledge, only from the points of view of heuristics and experimental results. This includes for instance results from Preuveneers and Berbers [20], Ouerfelli and Bouziri [18], and Dutot et al [9]. A related problem of maintaining a graph-coloring in an online fashion was studied by Borowiecki and Sidorowicz [5].…”

Section: Related Resultsmentioning

confidence: 99%

Dynamic Graph Coloring

et al. 2018

View full text Add to dashboard Cite

In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used. For any d > 0, the first algorithm maintains a proper O(CdN 1/d )-coloring while recoloring at most O(d) vertices per update, where C and N are the maximum chromatic number and maximum number of vertices, respectively. The second algorithm reverses the trade-off, maintaining an O(Cd)-coloring with O(dN 1/d ) recolorings per update. The two converge when d = log N , maintaining an O(C log N )-coloring with O(log N ) recolorings per update. We also present a lower bound, showing that any algorithm that maintains a c-coloring of a 2-colorable graph on N vertices must recolor at least Ω(N 2 c(c−1) ) vertices per update, for any constant c ≥ 2.

show abstract

Section: Related Resultsmentioning

confidence: 99%

Dynamic Graph Coloring

et al. 2018

View full text Add to dashboard Cite

show abstract

“…Dynamic graph coloring is a natural problem and there have been many works on this [15,29,31,20]. Most of these papers, however, have proposed heuristics and described experimental results.…”

mentioning

confidence: 99%

Dynamic Algorithms for Graph Coloring

Bhattacharya¹,

Chakrabarty²,

Henzinger³

et al. 2018

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

View full text Add to dashboard Cite

We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (∆ + 1)-vertex coloring and (2∆ − 1)-edge coloring in a graph with maximum degree ∆. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results.(1) We present a randomized algorithm which maintains a (∆ + 1)-vertex coloring with O(log ∆) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o (1)

show abstract

“…Atualmenteé desconhecida a existência de um bom algoritmo para determinação do número cromático, istoé, nega-se conhecer um algoritmo de coloração que seja executado em tempo polinomial. De fato, o problema de coloraçãoé considerado um problema NP-completo, exceto para alguns tipos específicos de grafos bipartidos eárvores os quais não se aplicam no problema considerado neste trabalho [Ouerfelli and Bouziri 2011].…”

Section: Coloração De Grafosunclassified

Preenchimento de Cache de Video na Borda da Rede Baseado em Coloração de Grafos

Engel¹,

Duarte²

2020

Anais Do XVIII Workshop Em Clouds E Aplicações (WCGA 2020)

View full text Add to dashboard Cite

Serviços de streaming de vídeo são frequentemente baseados em nuvens computacionais. Tendo em vista o aumento dos dispositivos móveis acessando este tipo de conteúdo, para garantir a qualidade de serviço requerida, é importante fazer uso de caches na borda da rede. Na medida em que as caches aproximam o conteúdo do usuário final, provocam uma redução do tráfego na nuvem e uma melhoria da experiência do usuário final. Este trabalho aborda um dos aspectos inerentes à utilização de caches, o preenchimento de conteúdo tendo em vista usuários finais em dispositivos móveis. Cada estação base tem uma cache associada. Uma estratégia de preenchimento de cache baseada em coloração de grafos é apresentada, na qual o conteúdo das caches é modificado sempre que há uma solicitação não atendida. A proposta foi avaliada através de simulação e comparada com alternativas e sempre apresentou a melhor taxa de acertos. Concluímos que o número e a distribuição de caches e dos usuários finais tem impacto na eficiência das diferentes estratégias.

show abstract

Greedy algorithms for dynamic graph coloring

Cited by 22 publications

References 11 publications

Dynamic Graph Coloring

Dynamic Graph Coloring

Dynamic Algorithms for Graph Coloring

Preenchimento de Cache de Video na Borda da Rede Baseado em Coloração de Grafos

Contact Info

Product

Resources

About