COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗ (Q4820145): Difference between revisions

@@ Property / cites work @@
+Sparse matrix test problems
@@ Property / cites work: Sparse matrix test problems / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785827
@@ Property / cites work: Q3785827 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997942
@@ Property / cites work: Q3997942 / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combining simulated annealing with local search heuristics
+Normal rank
@@ Property / cites work @@
+Partitioning Sparse Matrices with Eigenvectors of Graphs
+Normal rank
@@ Property / cites work @@
+Q3311639
@@ Property / cites work: Q3311639 / rank @@
+Normal rank
@@ Property / cites work @@
+How Good is Recursive Bisection?
@@ Property / cites work: How Good is Recursive Bisection? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4895228
@@ Property / cites work: Q4895228 / rank @@
+Normal rank