research
∙
03/10/2023
Simple and efficient four-cycle counting on sparse graphs
We consider the problem of counting 4-cycles (C_4) in a general undirect...
share
research
∙
04/30/2021
Triangle Centrality
Triangle centrality is introduced for finding important vertices in a gr...
research
∙
08/09/2019
A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges
Given an undirected, weighted graph, the minimum spanning tree (MST) is ...
research
∙
06/07/2019
Optimal algebraic Breadth-First Search for sparse graphs
There has been a rise in the popularity of algebraic methods for graph a...
research
∙
08/20/2018
Graph connectivity in log-diameter steps using label propagation
The fastest deterministic algorithms for connected components take logar...
research
∙
06/14/2018