"Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees."

Ran Duan, Haoqing He, Tianyi Zhang (2017)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-06-03

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1712-09166
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1712-09166
Ran Duan, Haoqing He, Tianyi Zhang:
Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees. CoRR abs/1712.09166 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.