Egon Balas, Jue Xue Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring. [Citation Graph (0, 0)][DBLP] Algorithmica, 1996, v:15, n:5, pp:397-412 [Journal]
Jue Xue, Ju Liu A network-flow-based lower bound for the minimum weighted integer coloring problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:1-2, pp:45-50 [Journal]
Egon Balas, Jue Xue Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:2, pp:209-221 [Journal]
Egon Balas, Jue Xue Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:5, pp:1000- [Journal]
Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP