Some spin glass ideas applied to the clique problem (Q885046): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3105587616
@@ Property / OpenAlex ID: W3105587616 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+cond-mat/0605336
@@ Property / arXiv ID: cond-mat/0605336 / rank @@
+Normal rank
@@ Property / cites work @@
+Reactive local search for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Mining relevant information on the Web: a clique-based approach
+Normal rank
@@ Property / cites work @@
+Maximum sizes of graphs with given domination parameters
+Normal rank
@@ Property / cites work @@
+Large Cliques Elude the Metropolis Process
@@ Property / cites work: Large Cliques Elude the Metropolis Process / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687246
@@ Property / cites work: Q5687246 / rank @@
+Normal rank
@@ Property / cites work @@
+The cavity method at zero temperature
@@ Property / cites work: The cavity method at zero temperature / rank @@
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2003
+Normal rank