z-logo
open-access-imgOpen Access
New Lower Bound for the Minimum Sum Coloring Problem
Author(s) -
Clément Lecat,
Corinne Lucet,
Chu-Min Li
Publication year - 2017
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.10661
Subject(s) - upper and lower bounds , bounding overwatch , fractional coloring , complete coloring , mathematics , graph coloring , computer science , combinatorics , discrete mathematics , graph , graph power , mathematical analysis , artificial intelligence , line graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom