Recent advances in fully dynamic graph algorithms–a quick reference guide
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Local higher-order graph clustering
Local graph clustering methods aim to find a cluster of nodes by exploring a small region of
the graph. These methods are attractive because they enable targeted clustering around a …
the graph. These methods are attractive because they enable targeted clustering around a …
Recent advances in fully dynamic graph algorithms
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
[PDF][PDF] Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks.
Bipartite networks are of great importance in many realworld applications. In bipartite
networks, butterfly (ie, a complete 2× 2 biclique) is the smallest non-trivial cohesive structure …
networks, butterfly (ie, a complete 2× 2 biclique) is the smallest non-trivial cohesive structure …
Hypergraph motifs: concepts, algorithms, and discoveries
Hypergraphs naturally represent group interactions, which are omnipresent in many
domains: collaborations of researchers, co-purchases of items, joint interactions of proteins …
domains: collaborations of researchers, co-purchases of items, joint interactions of proteins …
Butterfly counting in bipartite networks
SV Sanei-Mehri, AE Sariyuce, S Tirthapura - Proceedings of the 24th …, 2018 - dl.acm.org
We consider the problem of counting motifs in bipartite affiliation networks, such as author-
paper, user-product, and actor-movie relations. We focus on counting the number of …
paper, user-product, and actor-movie relations. We focus on counting the number of …
Sampling methods for counting temporal motifs
Pattern counting in graphs is fundamental to several network sci-ence tasks, and there is an
abundance of scalable methods for estimating counts of small patterns, often called motifs …
abundance of scalable methods for estimating counts of small patterns, often called motifs …
Accelerated butterfly counting with vertex priority on bipartite graphs
Bipartite graphs are of great importance in many real-world applications. Butterfly, which is a
complete 2× 2 biclique, plays a key role in bipartite graphs. In this paper, we investigate the …
complete 2× 2 biclique, plays a key role in bipartite graphs. In this paper, we investigate the …
Patterns and anomalies in k-cores of real-world graphs with applications
How do the k-core structures of real-world graphs look like? What are the common patterns
and the anomalies? How can we exploit them for applications? A k-core is the maximal …
and the anomalies? How can we exploit them for applications? A k-core is the maximal …
Midas: Representative sampling from real-world hypergraphs
Graphs are widely used for representing pairwise interactions in complex systems. Since
such real-world graphs are large and often evergrowing, sampling a small representative …
such real-world graphs are large and often evergrowing, sampling a small representative …