A robust and efficient algorithm for graph coloring problem based on Malatya centrality and sequent independent sets
The Graph Coloring Problem (GCP) is an NP-hard problem that aims to color the vertices of a graph using the minimum number of distinct colors, ensuring that adjacent vertices do not share the same color. GCP is widely applied in real-world scenarios and graph theory problems. Despite numerous studie...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-06-01
|
| Series: | Egyptian Informatics Journal |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1110866525000696 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|