"Finding the k Most Vital Edges in the Minimum Spanning Tree Problem."

Weifa Liang, Xiaojun Shen (1997)

> Home

Details and statistics

DOI: 10.1016/S0167-8191(97)00098-7

access: closed

type: Journal Article

metadata version: 2021-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pc/LiangS97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/LiangS97
Weifa Liang, Xiaojun Shen:
Finding the k Most Vital Edges in the Minimum Spanning Tree Problem. Parallel Comput. 23(13): 1889-1907 (1997)

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.