Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6377191
@@ Property / zbMATH DE Number: 6377191 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximum clique
@@ Property / zbMATH Keywords: maximum clique / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+degeneracy
@@ Property / zbMATH Keywords: degeneracy / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sparse graphs
@@ Property / zbMATH Keywords: sparse graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fixed-parameter
@@ Property / zbMATH Keywords: fixed-parameter / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+tractability
@@ Property / zbMATH Keywords: tractability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(d\)-degenerate graphs
@@ Property / zbMATH Keywords: \(d\)-degenerate graphs / rank @@
+Normal rank

Revision as of 18:49, 30 June 2023