June 15, 2017 conference-paper Open access Homomorphisms are a good basis for counting small subgraphs ACM SIGACT Symposium on Theory of Computing (STOC) DOI: 10.1145/3055399.3055502 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 81 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access The Complexity of Homomorphism Reconstructibility 2025 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research Open access 0 citations Homomorphism Tensors and Linear Equations 2025 Advances in Combinatorics article Computer Science Advanced Graph Theory Research Open access 5 citations word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data 2020 ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS) conference-paper Computer Science Advanced Graph Neural Networks Open access cited by 2 patents 179 citations 3 results References 0