A fast algorithm for the maximum clique problem (Q1613374): Difference between revisions

@@ Property / author @@
-Patric R. J. Östergård
@@ Property / author: Patric R. J. Östergård / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q56210432
@@ Property / Wikidata QID: Q56210432 / rank @@
+Normal rank
@@ Property / author @@
+Patric R. J. Östergård
@@ Property / author: Patric R. J. Östergård / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Finding maximum cliques in arbitrary and in special graphs
+Normal rank
@@ Property / cites work @@
+Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
+Normal rank
@@ Property / cites work @@
+Q3035310
@@ Property / cites work: Q3035310 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Test case generators and computational results for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Optimal binary one-error-correcting codes of length 10 have 72 codewords
+Normal rank
@@ Property / cites work @@
+The maximum clique problem
@@ Property / cites work: The maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a maximum clique in a graph
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(01)00290-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2046112356
@@ Property / OpenAlex ID: W2046112356 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1613374