"Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel."

Jens Gustedt (1998)

> Home

Details and statistics

DOI: 10.1007/BFB0028578

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stacs/Gustedt98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/Gustedt98
Jens Gustedt:
Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel. STACS 1998: 421-431

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.