A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2069537431
@@ Property / OpenAlex ID: W2069537431 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59409802
@@ Property / Wikidata QID: Q59409802 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7061
@@ Property / arXiv ID: 1407.7061 / rank @@
+Normal rank
@@ Property / cites work @@
+Anomalies in parallel branch-and-bound algorithms
@@ Property / cites work: Anomalies in parallel branch-and-bound algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-threading a state-of-the-art maximum clique algorithm
+Normal rank
@@ Property / cites work @@
+Exact algorithms for maximum clique: a computational study
+Normal rank
@@ Property / cites work @@
+An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
+Normal rank
@@ Property / cites work @@
+An improved bit parallel exact maximum clique algorithm
+Normal rank
@@ Property / cites work @@
+An exact bit-parallel algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q4452109
@@ Property / cites work: Q4452109 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2355318