A network-flow-based lower bound for the minimum weighted integer coloring problem (Q1589479): Difference between revisions

@@ Property / cites work @@
+Finding maximum cliques in arbitrary and in special graphs
+Normal rank
@@ Property / cites work @@
+Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
+Normal rank
@@ Property / cites work @@
+A theoretical analysis of backtracking in the graph coloring problem
+Normal rank
@@ Property / cites work @@
+On colouring random graphs
@@ Property / cites work: On colouring random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Column Generation Approach for Graph Coloring
@@ Property / cites work: A Column Generation Approach for Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Corrigendum: Static frequency assignment in cellular networks
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Q5687263
@@ Property / cites work: Q5687263 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3777423
@@ Property / cites work: Q3777423 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Solving the minimum weighted integer coloring problem
+Normal rank