"Efficient algorithms for finding minimum spanning trees in undirected and ..."

Harold N. Gabow et al. (1986)

> Home

Details and statistics

DOI: 10.1007/BF02579168

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/GabowGST86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/GabowGST86
Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan:
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Comb. 6(2): 109-122 (1986)

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.