most citedPlanted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning

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

collaborators

2 papers

cs.DC2022

BFS based distributed algorithm for parallel local directed sub-graph enumeration

Itay Levinas, Roy Scherz, Yoram Louzoun

Estimating the frequency of sub-graphs is of importance for many tasks, including sub-graph isomorphism, kernel-based anomaly detection, and network structure analysis. While multi…

cs.LG2022★ 2 cited

Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning

Itay Levinas, Yoram Louzoun

Multiple methods of finding the vertices belonging to a planted dense subgraph in a random dense graph have been proposed, with an emphasis on planted cliques. Such metho…