An exact algorithm for the maximum clique problem (Q922964): Difference between revisions

@@ Property / describes a project that uses @@
+Algorithm 457
@@ Property / describes a project that uses: Algorithm 457 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+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 @@
+On the complexity of approximating the independent set problem
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Q3793964
@@ Property / cites work: Q3793964 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique detection for nondirected graphs: Two new algorithms
+Normal rank
@@ Property / cites work @@
+Determining the number of internal stability of a graph
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+On the theory of graphs
@@ Property / cites work: On the theory of graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(90)90057-c
+Normal rank
@@ Property / OpenAlex ID @@
+W2026320281
@@ Property / OpenAlex ID: W2026320281 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:922964