Dawei Huang

activity

20162026

most citedApproximate Generalized Matching:

f

-Factors and

f

-Edge Covers

7 citations · 22 across the 5 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2017★ 7 cited

Approximate Generalized Matching: $f$ -Factors and $f$ -Edge Covers

Dawei Huang, Seth Pettie

In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include $O_{ε} (m)$ -time algorithms for $(1-ε)…

cs.DS2016★ 6 cited

Fully Dynamic Connectivity in $O (lo g n (lo g lo g n)^{2})$ Amortized Expected Time

Shang-En Huang, Dawei Huang, Tsvi Kopelowitz +2

Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure with $O(\log n(\log\…

Approximate Generalized Matching: f-Factors and f-Edge Covers

Fully Dynamic Connectivity in O(logn(loglogn)2) Amortized Expected Time

Approximate Generalized Matching: $f$ -Factors and $f$ -Edge Covers

Fully Dynamic Connectivity in $O (lo g n (lo g lo g n)^{2})$ Amortized Expected Time