2 citations · 2 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
A Scaling Algorithm for Weighted -Factors in General Graphs
Ran Duan, Haoqing He, Tianyi Zhang
We study the maximum weight perfect -factor problem on any general simple graph with positive integral edge weights , and , . When we have a functio…
cs.DS2017
Near-linear Time Algorithm for Approximate Minimum Degree Spanning Trees
Ran Duan, Haoqing He, Tianyi Zhang
Given a graph , we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known…