A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs (Q1909003): Difference between revisions

@@ Property / author @@
-Jan H. M. Korst
@@ Property / author: Jan H. M. Korst / rank @@
-Normal rank
@@ Property / author @@
+Jan H. M. Korst
@@ Property / author: Jan H. M. Korst / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994799
@@ Property / cites work: Q3994799 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+Q4023942
@@ Property / cites work: Q4023942 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997942
@@ Property / cites work: Q3997942 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Local Search Problems that are Hard to Solve
+Normal rank