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

@@ Property / describes a project that uses @@
+TABARIS
@@ Property / describes a project that uses: TABARIS / 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 @@
+A branch and bound algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+A node covering algorithm
@@ Property / cites work: A node covering algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
+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 @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / 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 @@
+TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
+Normal rank
@@ Property / cites work @@
+An algorithm for the maximum internally stable set in a weighted graph
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a maximum weighted independent set in an arbitrary graph
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02243394
+Normal rank
@@ Property / OpenAlex ID @@
+W9324657
@@ Property / OpenAlex ID: W9324657 / rank @@
+Normal rank