activity
20192023
most citedA Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets

111 citations · 111 across the 2 of their papers we have counts for

collaborators
Showing 2019Show all

3 papers · 1 filter

cs.DS2019★ 111 cited

A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets

Pedro Ribeiro, Pedro Paredes, Miguel E. P. Silva +2

Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have…

cs.DS2019

Explicit near-Ramanujan graphs of every degree

Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes

For every constant and , we give a deterministic -time algorithm that outputs a -regular graph on vertices that is -near-Ramanujan;…

cs.DS2019

The SDP value for random two-eigenvalue CSPs

Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes

We precisely determine the SDP value (equivalently, quantum value) of large random instances of certain kinds of constraint satisfaction problems, ``two-eigenvalue 2CSPs''. We show…