Affiliation:
1. University of Milan, Italy
Funder
Bertinoro International Center for Informatics (BICI)
European Research Council
Dipartimento di Informatica, Sapienza Università di Roma
Google
Reference34 articles.
1. Mixing time bounds for graphlet random walks
2. David Aldous and James Fill. 1995. Reversible Markov chains and random walks on graphs. https://www.stat.berkeley.edu/~aldous/RWG/book.pdf David Aldous and James Fill. 1995. Reversible Markov chains and random walks on graphs. https://www.stat.berkeley.edu/~aldous/RWG/book.pdf
3. Biomolecular network motif counting and discovery by color coding
4. Color-coding
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Fast and Perfect Sampling of Subgraphs and Polymer Systems;ACM Transactions on Algorithms;2024-01-22
2. Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs;ACM Transactions on Algorithms;2023-06-24
3. Motif Cut Sparsifiers;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Efficient and near-optimal algorithms for sampling connected subgraphs;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15