14 citations · 47 across the 9 of their papers we have counts for
6 papers · 1 filter
Scalable Algorithms for Approximate DNF Model Counting
Paul Burkhardt, David G. Harris, Kevin T Schmitt
Model counting of Disjunctive Normal Form (DNF) formulas is a critical problem in applications such as probabilistic inference and network reliability. For example, it is often use…
Simple and efficient four-cycle counting on sparse graphs
Paul Burkhardt, David G. Harris
We consider the problem of counting 4-cycles () in an undirected graph of vertices and edges (in bipartite graphs, 4-cycles are also often referred to as $\textit{…
Triangle Centrality
Paul Burkhardt
Triangle centrality is introduced for finding important vertices in a graph based on the concentration of triangles surrounding each vertex. It has the distinct feature of allowing…
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…
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…
Graph connectivity in log steps using label propagation
Paul Burkhardt
The fastest deterministic algorithms for connected components take logarithmic time and perform superlinear work on a Parallel Random Access Machine (PRAM). These algorithms mainta…