Results 241 to 250 of about 129,100 (297)
Some of the next articles are maybe not open access.
On the Complexity of Distributed Greedy Coloring
International Symposium on Distributed Computing, 2007Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. It still consists in coloring in a distributed setting each node of a given graph in such a way that two adjacent nodes do not get the same color, but it adds a further constraint.
C. GAVOILLE +3 more
openaire +3 more sources
On Greedy Graph Coloring in the Distributed Model
, 2006 In the paper we consider distributed algorithms for greedy graph coloring. For the largest-first (LF) approach, we propose a new distributed algorithm which is shown to color a graph in an expected time of O(ΔlognlogΔ) rounds, and we prove that any distributed LF-coloring algorithm requires at least Ω(Δ) rounds.
Adrian Kosowski, Łukasz Kuszner
+5 more sources
Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be?
Computers & Operations ResearchzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mateus C. Silva +4 more
openaire +3 more sources
Greedy and heuristic algorithms for codes and colorings
IEEE Transactions on Information Theory, 1998 This paper deals with specific problems of coding theory. The problem of constructing a code with given minimum Hamming distance is formulated as the task to construct, in a metric space with discrete metric, such a set in which the distance between elements is not smaller than a given value.
Tuvi Etzion, Patric R. J. Östergård
openalex +3 more sources
Solving Graph Coloring Problem Using New Greedy and Probabilistic Method
2022 8th International Conference on Advanced Computing and Communication Systems (ICACCS), 2022S Balakrishnan +2 more
openaire +2 more sources
Greedy algorithms for dynamic graph coloring
2011 International Conference on Communications, Computing and Control Applications (CCCA), 2011Many 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.
Linda Ouerfelli, Hend Bouziri
openaire +1 more source
Greedy tree growing for color image quantization
Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing, 2002Displaying a true color image in a low cost color monitor or printer is very important in many applications. The basic problem is how to display 2/sup 24/ colors with K(usually K=256 or less) colors, called a color palette. The authors propose an algorithm to design the K-color palette by an unbalanced greedy binary tree.
null Tsann-Shyong Liu +1 more
openaire +1 more source
GREEDY RECOGNITION AND COLORING ALGORITHMS FOR INDIFFERENCE GRAPHS
, 1992 P. Looges, Stephan Olariu
openalex +2 more sources
An Efficient UAV Cache File Cooperative Response Algorithm Based on Greedy Graph Coloring
2025 5th International Conference on Sensors and Information TechnologyMulti-UAV networks play a pivotal role in collaborative task execution within complex environments, yet achieving efficient data sharing remains a critical challenge.
Fangyuan Liu, Zhexin Xu
semanticscholar +1 more source
A New Greedy Algorithm for Improving b-Coloring Clustering
2007This paper proposes a new greedy algorithm to improve the specified b-coloring partition while satisfying b-coloring property. The b-coloring based clustering method in [3] enables to build a fine partition of the data set (classical or symbolic) into clusters even when the number of clusters is not pre-defined.
Elghazel, Haytham +4 more
openaire +2 more sources