"Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree ..."

Li-Jen Mao, Sheau-Dong Lang (2002)

> Home

Details and statistics

DOI: 10.1109/ICPPW.2002.1039757

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/icppw/MaoL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icppw/MaoL02
Li-Jen Mao, Sheau-Dong Lang:
Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique. ICPP Workshops 2002: 398-404

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.