"Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees."

Ran Duan, Haoqing He, Tianyi Zhang (2020)

> Home

Details and statistics

DOI: 10.1007/978-3-030-61792-9_2

access: closed

type: Conference or Workshop Paper

metadata version: 2020-12-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/DuanH020
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/DuanH020
Ran Duan, Haoqing He, Tianyi Zhang:
Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees. LATIN 2020: 15-26

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.