Obserwuj
Noujan Pashanasangi
Noujan Pashanasangi
University of California, Santa Cruz
Zweryfikowany adres z ucsc.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Linear time subgraph counting, graph degeneracy, and the chasm at size six
SK Bera, N Pashanasangi, C Seshadhri
arXiv preprint arXiv:1911.05896, 2019
332019
Efficiently counting vertex orbits of all 5-vertex subgraphs, by evoke
N Pashanasangi, C Seshadhri
Proceedings of the 13th International Conference on Web Search and Data …, 2020
202020
Near-linear time homomorphism counting in bounded degeneracy graphs: The barrier of long induced cycles
SK Bera, N Pashanasangi, C Seshadhri
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
162021
Faster and generalized temporal triangle counting, via degeneracy ordering
N Pashanasangi, C Seshadhri
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021
72021
The Role of Degeneracy in Real-World Subgraph Counting
N Pashanasangi
University of California, Santa Cruz, 2021
2021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–5