14 citations · 47 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 4 cited
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
David A. Bader, Paul Burkhardt
Given an undirected, weighted graph, the minimum spanning tree (MST) is a tree that connects all of the vertices of the graph with minimum sum of edge weights. In real world applic…
cs.DS2019★ 14 cited
Optimal algebraic Breadth-First Search for sparse graphs
Paul Burkhardt
There has been a rise in the popularity of algebraic methods for graph algorithms given the development of the GraphBLAS library and other sparse matrix methods. An exemplar for th…