An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883): 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 @@
+A graph‐theoretic definition of a sociometric clique†
+Normal rank
@@ Property / cites work @@
+Three‐dimensional blockmodels
@@ Property / cites work: Three‐dimensional blockmodels / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics for finding \(k\)-clubs in an undirected graph
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the maximum clique problem using a tabu search approach
+Normal rank
@@ Property / cites work @@
+Q4714131
@@ Property / cites work: Q4714131 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3685214
@@ Property / cites work: Q3685214 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1600883