Local optima topology for the \(k\)-coloring problem (Q1327233): Difference between revisions

@@ Property / cites work @@
+Q4673630
@@ Property / cites work: Q4673630 / rank @@
+Normal rank
@@ Property / cites work @@
+Path Partitions in Directed Graphs
@@ Property / cites work: Path Partitions in Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some experiments with simulated annealing for coloring graphs
+Normal rank
@@ Property / cites work @@
+An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part II
@@ Property / cites work: Tabu Search—Part II / rank @@
+Normal rank
@@ Property / cites work @@
+Using tabu search techniques for graph coloring
@@ Property / cites work: Using tabu search techniques for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058442
@@ Property / cites work: Q4058442 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(IVI^3)\) algorithm for finding maximum flows in networks
+Normal rank