مؤتمر
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
| العنوان: | Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies |
|---|---|
| المؤلفون: | Bressan, Marco, Roth, Marc |
| المصدر: | 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2021 IEEE 62nd Annual Symposium on. :276-285 Feb, 2022 |
| Relation: | 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) |
| قاعدة البيانات: | IEEE Xplore Digital Library |
Full Text Finder | ردمك: | 9781665420556 |
|---|---|
| تدمد: | 25758454 |
| DOI: | 10.1109/FOCS52979.2021.00036 |