David G. Harris

activity

20132026

most citedBounds and algorithms for graph trusses

6 citations · 33 across the 33 of their papers we have counts for

collaborators

Showing 2023 · cs.DSShow all

2 papers · 2 filters

cs.DS2023

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time

David G. Harris

We describe a new dependent-rounding algorithmic framework for bipartite graphs. Given a fractional assignment $x$ of values to edges of graph $G = (U \cup V, E)$ , the algorit…

cs.DS2023★ 2 cited

Simple and efficient four-cycle counting on sparse graphs

Paul Burkhardt, David G. Harris

We consider the problem of counting 4-cycles ( $C_{4}$ ) in an undirected graph $G$ of $n$ vertices and $m$ edges (in bipartite graphs, 4-cycles are also often referred to as $\textit{…