Coloring Dynamic Graphs With a Similarity and Pool-Based Evolutionary Algorithm
Sign Up to like & getrecommendations! Published in 2025 at "IEEE Access"
DOI: 10.1109/access.2025.3546108
Abstract: The graph coloring problem is a well-known optimization challenge, particularly relevant in dynamic environments where the graph undergoes continuous changes over time. Evolutionary algorithms, known for their adaptability and effectiveness in handling NP-hard problems, are… read more here.
Keywords: coloring dynamic; algorithm; dynamic graphs; similarity pool ... See more keywords