Solving connected dominating set faster than $2^n$ (Q958203): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-007-9145-z
@@ Property / DOI: 10.1007/s00453-007-9145-z / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q60488749
@@ Property / Wikidata QID: Q60488749 / 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.1007/s00453-007-9145-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2040813792
@@ Property / OpenAlex ID: W2040813792 / rank @@
+Normal rank
@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
+Normal rank
@@ Property / cites work @@
+Q5692521
@@ Property / cites work: Q5692521 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved deterministic local search algorithm for 3-SAT
+Normal rank
@@ Property / cites work @@
+Enumerating maximal independent sets with applications to graph colouring.
+Normal rank
@@ Property / cites work @@
+A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396567
@@ Property / cites work: Q3396567 / rank @@
+Normal rank
@@ Property / cites work @@
+Measure and conquer
@@ Property / cites work: Measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the complexity of minimum dominating set
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Simpler and better approximation algorithms for network design
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q3395987
@@ Property / cites work: Q3395987 / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for the Steiner Tree Problem
@@ Property / cites work: A Faster Algorithm for the Steiner Tree Problem / rank @@
+Normal rank
@@ Property / cites work @@
+-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
+Normal rank
@@ Property / cites work @@
+Exact Computation of Maximum Induced Forest
@@ Property / cites work: Exact Computation of Maximum Induced Forest / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for connected facility location problems
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414647
@@ Property / cites work: Q4414647 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-007-9145-Z
@@ Property / DOI: 10.1007/S00453-007-9145-Z / rank @@
+Normal rank

Solving connected dominating set faster than \(2^n\) (Q958203): Difference between revisions

Latest revision as of 09:59, 10 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)