| Title: |
Homomorphisms are a good basis for counting small subgraphs |
| Article URLs: |
|
| Alternative Article URLs: |
https://arxiv.org/abs/1705.01595 |
| Authors: |
Radu Curticapean |
-
Hungarian Academy of Sciences, Institute for Computer Science and Control
|
| Holger Dell |
-
Saarland University, Cluster of Excellence (MMCI)
|
| Dániel Marx |
-
Hungarian Academy of Sciences, Institute for Computer Science and Control
|
| Sharing: |
Research produced no artifacts
|
| Verification: |
Authors have
verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
|
| DBLP Key: |
conf/stoc/CurticapeanDM17
|
| Author Comments: |
|