Old Web
English
Sign In
Acemap
>
Paper
>
A heuristic for the convex recoloring problem in graphs
A heuristic for the convex recoloring problem in graphs
2020
Ana Paula dos Santos Dantas
Cid C. de Souza
Zanoni Dias
Keywords:
Combinatorial optimization
Regular polygon
Combinatorics
Graph
Heuristic
Computer science
GRASP
Correction
Source
Cite
Save
Machine Reading By IdeaReader
18
References
0
Citations
NaN
KQI
[]