Paul Burkhardt

15 papers Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Scalable Algorithms for Approximate DNF Model Counting.
CoRR
Paul Burkhardt, David G. Harris, Kevin T. Schmitt
2024 J jnl
Triangle Centrality.
ACM Trans. Knowl. Discov. Data
Paul Burkhardt
2023 J jnl
Simple and efficient four-cycle counting on sparse graphs.
CoRR
Paul Burkhardt, David G. Harris
2022 — ch.
A Cloud-Based Approach to Big Graphs.
Massive Graph Analytics
Paul Burkhardt, Christopher A. Waring
2022 J jnl
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges.
J. Graph Algorithms Appl.
David A. Bader, Paul Burkhardt
2021 J jnl
Graph Connectivity in Log Steps Using Label Propagation.
Parallel Process. Lett.
Paul Burkhardt
2021 J jnl
Optimal Algebraic Breadth-First Search for Sparse Graphs.
ACM Trans. Knowl. Discov. Data
Paul Burkhardt
2021 J jnl
Triangle Centrality.
CoRR
Paul Burkhardt
2020 J jnl
Bounds and algorithms for graph trusses.
J. Graph Algorithms Appl.
Paul Burkhardt, Vance Faber, David G. Harris
2019 J jnl
A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges.
CoRR
David A. Bader, Paul Burkhardt
2019 J jnl
Optimal algebraic Breadth-First Search for sparse graphs.
CoRR
Paul Burkhardt
2018 J jnl
Bounds and algorithms for k-truss.
CoRR
Paul Burkhardt, Vance Faber, David G. Harris
2018 J jnl
Graph connectivity in log-diameter steps using label propagation.
CoRR
Paul Burkhardt
2017 J jnl
Graphing trillions of triangles.
Inf. Vis.
Paul Burkhardt
2015 — conf
A cloud-based approach to big graphs.
HPEC
Paul Burkhardt, Christopher A. Waring