Search Results for author:
Found 1 papers, 1 papers with code
Local Motif Clustering via (Hyper)Graph Partitioning
A widely-used operation on graphs is local clustering, i. e., extracting a well-characterized community around a seed node without the need to process the whole graph.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
