Homomorphisms are a good basis for counting small subgraphs
Curticapean, Radu and Dell, H and Marx, Dániel (2017) Homomorphisms are a good basis for counting small subgraphs. In: 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017. Association for Computing Machinery, New York, pp. 210-223. ISBN 9781450345286 10.1145/3055399.3055502
|
Text
Curticapean_210_3297382_ny.pdf Download (812kB) | Preview |
| Item Type: | Book Section |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Informatics Laboratory |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 30 Nov 2017 19:53 |
| Last Modified: | 21 Jul 2019 13:55 |
| URI: | https://eprints.sztaki.hu/id/eprint/9230 |
 |
Update Item |
