Optimal Streaming Algorithms for Graph Matching

no code implementations • 13 Feb 2021 • Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia

For the dynamic streaming model, we present a one-pass algorithm that, with high probability, computes a maximum-weight $k$-matching of a weighted graph in $\tilde{O}(Wk^2)$ space and that has $\tilde{O}(1)$ update time, where $W$ is the number of distinct edge weights and the notation $\tilde{O}()$ hides a poly-logarithmic factor in the input size.

Graph Matching Data Structures and Algorithms Computational Complexity

Near-Optimal Algorithms for Point-Line Covering Problems

no code implementations • 4 Dec 2020 • Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia

Both algorithms improve the running time of existing kernelization algorithms for Line Cover.

Computational Geometry Data Structures and Algorithms