Results 21 to 30 of about 129,100 (297)

A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring [PDF]

, 2018
We introduce a dynamic version of the graph coloring problem and prove its fixed-parameter tractability with respect to the edit-parameter. This is used to present a {\em turbo-charged} heuristic for the problem that works by combining the turbo-charging technique with other standard heuristic tools, including greedy coloring.
Faisal N. Abu-Khzam, Bachir M. Chahine
openalex   +3 more sources

Greedy colorings of words

Discrete Applied Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dieter Rautenbach, Zoltán Szigeti
  +5 more sources

Greedy colorings for the binary paintshop problem

Journal of Discrete Algorithms, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hadis Amini, Frédéric Meunier, H. Michel, Atefeh Mohajeri   +3 more
openalex   +3 more sources

Toward Improving b-Coloring Based Clustering Using a Greedy re-Coloring Algorithm

, 2008
In our current approach we employ a greedy strategy tackle the re-coloring problem defined in Section 4.1. The major reasons for utilizing a greedy strategy is, as in other many approaches based on some greedy algorithms, we believe that it is useful as well as crucial for handling real world data, especially for large scale data.
Tetsuya Yoshida, Haytham Elghazel, Vronique Deslandres, Mohand-Saïd Hacid, A. Dussauchoy   +4 more
openalex   +4 more sources

Greedy algorithms for distance-2 graph coloring and bipartite graph partial coloring [PDF]

, 2019
oşut bir uygulamanın görev etkileşim çizgesi komşu görevlerin farklı renklerle boyandığında birbirleri ile aynı renkteki görevler aynı anda pahalı bir senkronizasyon veri yapısı kullanılmadan aynı anda çalıştırılabilmektedir. Bu tür bir çalıştırmada bir renkteki görevler bitirilmeden, başka bir renkteki görev koşut halde şlenemeyeceğinden boyama ...
Mustafa Kemal Taş
openalex   +3 more sources

A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic [PDF]

European Journal of Operational Research, 2021
Rafael A. Melo, Michell Queiroz, Marcio Costa Santos   +2 more
openalex   +3 more sources

A framework for scalable greedy coloring on distributed-memory parallel computers

Journal of Parallel and Distributed Computing, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bozdağ, Doruk, Gebremedhin, Assefaw H., Manne, Fredrik, Boman, Erik G., Catalyurek, Umit V.   +4 more
openaire   +3 more sources

The Greedy Algorithm Is not Optimal for On-Line Edge Coloring

, 2021
Nearly three decades ago, Bar-Noy, Motwani and Naor showed that no online edge-coloring algorithm can edge color a graph optimally. Indeed, their work, titled "the greedy algorithm is optimal for on-line edge coloring", shows that the competitive ratio of 2 of the naïve greedy algorithm is best possible online.
Amin Saberi, David Wajc
openalex   +4 more sources

Results on the Connected Greedy Coloring Game

Matemática Contemporânea
Thiago Marcilon, Ariane Ribeiro
openaire   +2 more sources

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\Delta$-Coloring [PDF]

TheoretiCS, 2023
Every graph with maximum degree $\Delta$ can be colored with $(\Delta+1)$ colors using a simple greedy algorithm. Remarkably, recent work has shown that one can find such a coloring even in the semi-streaming model.
Sepehr Assadi, Pankaj Kumar, Parth Mittal   +2 more
doaj   +1 more source