"An Algorithm for Finding K Minimum Spanning Trees."

Naoki Katoh, Toshihide Ibaraki, Hisashi Mine (1981)

> Home

Details and statistics

DOI: 10.1137/0210017

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/KatohIM81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/KatohIM81
Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for Finding K Minimum Spanning Trees. SIAM J. Comput. 10(2): 247-255 (1981)

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.