Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.jcss.2008.02.004 / rank | |||
Property / author | |||
Property / author: Josep Diaz / rank | |||
Property / author | |||
Property / author: Maria J. Serna / rank | |||
Property / author | |||
Property / author: Josep Diaz / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Maria J. Serna / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2008.02.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2112022679 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nondeterminism within $P^ * $ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2747613 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4779153 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4660720 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms – ESA 2004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The restrictive \(H\)-coloring problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3424889 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity issues on bounded restrictive \(H\)-coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4281497 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4027320 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4393480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Corrigendum: The complexity of counting graph homomorphisms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4521549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: List homomorphisms to reflexive graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: List homomorphisms and circular arc graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Parameterized Complexity of Counting Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4660723 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4828516 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5710169 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4708603 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms and Data Structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding odd cycle transversals. / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.JCSS.2008.02.004 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:38, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient algorithms for counting parameterized list \(H\)-colorings |
scientific article |
Statements
Efficient algorithms for counting parameterized list \(H\)-colorings (English)
0 references
26 June 2008
0 references
restrictive \(H\)-coloring
0 references
restrictive list \(H\)-coloring
0 references
parameterization
0 references
counting problems
0 references
0 references