Greedy algorithms for dynamic graph coloring

Linda Ouerfelli; Hend Bouziri

Found an issue? Give us feedback

https://doi.org/10.1...arrow_drop_down

https://doi.org/10.1109/ccca.2...

Article . 2011 . Peer-reviewed

Data sources: Crossref

https://dx.doi.org/10.1109/ccc...

Article

Data sources: Microsoft Academic Graph

Greedy algorithms for dynamic graph coloring

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 2011Publisher:IEEEJournal:2011 International Conference on Communications, Computing and Control Applications (CCCA)

Authors: Linda Ouerfelli; Hend Bouziri;

doi: 10.1109/ccca.2011.6031437

Greedy algorithms for dynamic graph coloring

- Summary
- Metrics

Abstract

Many real life applications are subject to changes which can be modeled as dynamic graphs. In this paper, we are interested especially in the dynamic graph coloring. We focus on coloring using online algorithms and we propose new greedy approaches to solve it efficiently.

Related Organizations

Tunis University
Tunisia
Tunis El Manar University
Tunisia

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	15
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average