Expected polynomial-time randomized algorithm for graph coloring problem
Discrete Applied Mathematics, ISSN: 0166-218X, Vol: 354, Page: 108-121
2024
- 1Citations
- 1Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
Given a graph G=(V,E) with n=|V| vertices, the graph coloring problem is defined as Find a color vector C=(c(v)), where c(v)∈{1,2,…,n} denotes the color of vertex v∈V, such that no monochromatic edge exists in G and the span, the total number of distinct colors in C, is minimized. Since the problem is NP-complete, a greedy coloring is commonly used for solving it. Greedy coloring visits the vertices of G following an order S, and while visiting a vertex v, it puts the minimum color absent in all neighbors of v. We show that the orders producing span ≤k, where k≤n is a positive integer, can be partitioned into disjoint subsets of equivalent orders. Next, we propose a selective search (SS) algorithm, which takes ρ as an input parameter, selects ≥ρ orders each from a different set of equivalent orders with high probability, applies greedy coloring on them, and returns the color vector with minimum span. We analytically show that SS performs better than greedy coloring with high probability by evaluating the same number of orders. We propose an incremental search heuristic (ISH), which ρ1 times execute SS with parameter ρ2 and returns the color vector with minimum span. A parallel version of ISH called PISH is also proposed, executing ρ1 SS calls in parallel. We show that ISH hits an optimum coloring for a graph G=(V,E) with χ(G)(Δ(G)+1)≤ne in expected O(|V|+|E|) time and space complexities. We have evaluated ISH and PISH on 136 challenging benchmarks and shown that they significantly outperform 10 existing state-of-the-art algorithms. Finally, we validated our theoretical findings by evaluating ISH and greedy coloring on random graphs.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0166218X23003037; http://dx.doi.org/10.1016/j.dam.2023.08.001; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85168574262&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0166218X23003037; https://dx.doi.org/10.1016/j.dam.2023.08.001
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know