Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)（2022）
Key words
counting problems,degenerate graphs,fine-grained complexity theory,parameterized algorithms
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