An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) (Q2364488): Difference between revisions

@@ Property / DOI @@
-.1007/s10107-016-1080-9
@@ Property / DOI: 10.1007/s10107-016-1080-9 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2548429154
@@ Property / OpenAlex ID: W2548429154 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05773
@@ Property / arXiv ID: 1501.05773 / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Q3416248
@@ Property / cites work: Q3416248 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
+Normal rank
@@ Property / cites work @@
+Finding and counting small induced subgraphs efficiently
+Normal rank
@@ Property / cites work @@
+An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
+Normal rank
@@ Property / DOI @@
+.1007/S10107-016-1080-9
@@ Property / DOI: 10.1007/S10107-016-1080-9 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2364488