Mining relevant information on the Web: a clique-based approach (Q5444416): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / 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/00207540600693713
+Normal rank
@@ Property / OpenAlex ID @@
+W2002695469
@@ Property / OpenAlex ID: W2002695469 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Reactive local search for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
+Normal rank
@@ Property / cites work @@
+STABULUS: A technique for finding stable sets in large graphs with tabu search
+Normal rank
@@ Property / cites work @@
+Solving the maximum clique problem using a tabu search approach
+Normal rank
@@ Property / cites work @@
+Q4400840
@@ Property / cites work: Q4400840 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Adaptive, restart, randomized greedy heuristics for maximum clique
+Normal rank
@@ Property / cites work @@
+Q4472034
@@ Property / cites work: Q4472034 / rank @@
+Normal rank