Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds
PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA（2022）
Key words
Graph homomorphism,list homomorphism,counting complexity,parameterized complexity,tight bounds,treewidth
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined