Efficient algorithms for counting parameterized list $H$-colorings (Q931733): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2008.02.004
@@ Property / DOI: 10.1016/j.jcss.2008.02.004 / 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.1016/j.jcss.2008.02.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2112022679
@@ Property / OpenAlex ID: W2112022679 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
+Normal rank
@@ Property / cites work @@
+Nondeterminism within $P^ *  $
@@ Property / cites work: Nondeterminism within $P^ * $ / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779153
@@ Property / cites work: Q4779153 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4660720
@@ Property / cites work: Q4660720 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+The restrictive \(H\)-coloring problem
@@ Property / cites work: The restrictive \(H\)-coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424889
@@ Property / cites work: Q3424889 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity issues on bounded restrictive \(H\)-coloring
+Normal rank
@@ Property / cites work @@
+Q4281497
@@ Property / cites work: Q4281497 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027320
@@ Property / cites work: Q4027320 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Corrigendum: The complexity of counting graph homomorphisms
+Normal rank
@@ Property / cites work @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+List homomorphisms to reflexive graphs
@@ Property / cites work: List homomorphisms to reflexive graphs / rank @@
+Normal rank
@@ Property / cites work @@
+List homomorphisms and circular arc graphs
@@ Property / cites work: List homomorphisms and circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4660723
@@ Property / cites work: Q4660723 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828516
@@ Property / cites work: Q4828516 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4708603
@@ Property / cites work: Q4708603 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2008.02.004
@@ Property / DOI: 10.1016/J.JCSS.2008.02.004 / rank @@
+Normal rank

Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733): Difference between revisions

Latest revision as of 08:38, 10 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)