A global optimization approach for solving the maximum clique problem (Q4009762): Difference between revisions

@@ Property / author @@
-Panos M. Pardalos
@@ Property / author: Panos M. Pardalos / rank @@
-Normal rank
@@ Property / author @@
+Panos M. Pardalos
@@ Property / author: Panos M. Pardalos / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207169008803851
+Normal rank
@@ Property / OpenAlex ID @@
+W2071702553
@@ Property / OpenAlex ID: W2071702553 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper Bounds on the Order of a Clique of a Graph
@@ Property / cites work: Upper Bounds on the Order of a Clique of a Graph / 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 @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Clique detection for nondirected graphs: Two new algorithms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Determining the number of internal stability of a graph
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+Constrained global optimization: algorithms and applications
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank