Old Web
English
Sign In
Acemap
>
Paper
>
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems.
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems.
2015
Denis Cornaz
Fabio Furini
Enrico Malaguti
Keywords:
Discrete mathematics
Vertex (geometry)
Fractional coloring
Independent set
Combinatorics
Feedback vertex set
Computer science
Complete coloring
Vertex (graph theory)
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]