An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/10556788.2017.1281924
+Normal rank
@@ Property / OpenAlex ID @@
+W2579912193
@@ Property / OpenAlex ID: W2579912193 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast local search for the maximum independent set problem
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+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 @@
+On chromatic number of graphs and set-systems
@@ Property / cites work: On chromatic number of graphs and set-systems / rank @@
+Normal rank
@@ Property / cites work @@
+A new exact maximum clique algorithm for large and massive sparse graphs
+Normal rank
@@ Property / cites work @@
+An improved bit parallel exact maximum clique algorithm
+Normal rank
@@ Property / cites work @@
+Infra-chromatic bound for exact maximum clique search
+Normal rank
@@ Property / cites work @@
+An exact bit-parallel algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Relaxed approximate coloring in exact maximum clique search
+Normal rank
@@ Property / cites work @@
+A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
+Normal rank
@@ Property / cites work @@
+An adaptive multistart tabu search approach to solve the maximum clique problem
+Normal rank
@@ Property / cites work @@
+A review on algorithms for maximum clique problems
+Normal rank