Paul Burkhardt

According to our database, Paul Burkhardt authored at least 12 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Simple and efficient four-cycle counting on sparse graphs.

Paul Burkhardt, David G. Harris

CoRR, 2023

2022

A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges.

David A. Bader, Paul Burkhardt

J. Graph Algorithms Appl., 2022

A Cloud-Based Approach to Big Graphs.

Paul Burkhardt, Christopher A. Waring

Proceedings of the Massive Graph Analytics, 2022

2021

Optimal Algebraic Breadth-First Search for Sparse Graphs.

Paul Burkhardt

ACM Trans. Knowl. Discov. Data, 2021

Graph Connectivity in Log Steps Using Label Propagation.

Paul Burkhardt

Parallel Process. Lett., 2021

Triangle Centrality.

Paul Burkhardt

CoRR, 2021

2020

Bounds and algorithms for graph trusses.

Paul Burkhardt, Vance Faber, David G. Harris

J. Graph Algorithms Appl., 2020

2019

A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges.

David A. Bader, Paul Burkhardt

CoRR, 2019

2018

Graph connectivity in log-diameter steps using label propagation.

Paul Burkhardt

CoRR, 2018

Bounds and algorithms for k-truss.

Paul Burkhardt, Vance Faber, David G. Harris

CoRR, 2018

2017

Graphing trillions of triangles.

Paul Burkhardt

Inf. Vis., 2017

2015

A cloud-based approach to big graphs.

Paul Burkhardt, Christopher A. Waring

Proceedings of the 2015 IEEE High Performance Extreme Computing Conference, 2015