A refined algorithm for maximum independent set in degree-4 graphs (Q1680494): Difference between revisions

@@ 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.1007/s10878-017-0115-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2185104320
@@ Property / OpenAlex ID: W2185104320 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
+Normal rank
@@ Property / cites work @@
+Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$
+Normal rank
@@ Property / cites work @@
+Fast algorithms for max independent set
@@ Property / cites work: Fast algorithms for max independent set / rank @@
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
+Normal rank
@@ Property / cites work @@
+Pathwidth of cubic graphs and exact algorithms
@@ Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+A measure &amp; conquer approach for the analysis of exact algorithms
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs
+Normal rank
@@ Property / cites work @@
+An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem
+Normal rank
@@ Property / cites work @@
+A Fine-grained Analysis of a Simple Independent Set Algorithm
+Normal rank
@@ Property / cites work @@
+Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs
+Normal rank
@@ Property / cites work @@
+Further Improvement on Maximum Independent Set in Degree-4 Graphs
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Maximum Independent Set
@@ Property / cites work: Exact Algorithms for Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for maximum independent set in degree-5 graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1680494