First Page | Document Content | |
---|---|---|
Date: 2013-04-15 10:45:37Graph coloring NP-complete problems Edge coloring Independent set Matching Maximal independent set Interval graph Bipartite graph Domatic number Graph theory Mathematics Theoretical computer science | On Chromatic Sums and Distributed Resource Allocation Amotz Bar-Noy∗ Mihir Bellare† Hadas Shachnai§Add to Reading ListSource URL: www.cs.technion.ac.ilDownload Document from Source WebsiteFile Size: 157,70 KBShare Document on Facebook |