Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697): Difference between revisions

@@ 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 fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
+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 @@
+Q3216686
@@ Property / cites work: Q3216686 / rank @@
+Normal rank
@@ Property / cites work @@
+A graph coloring algorithm for large scheduling problems
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+Q5670645
@@ Property / cites work: Q5670645 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank
@@ Property / cites work @@
+Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
+Normal rank