"An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree ..."

Seth Pettie (2006)

> Home

Details and statistics

DOI: 10.1007/S00493-006-0014-1

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/Pettie06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/Pettie06
Seth Pettie:
An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification. Comb. 26(2): 207-230 (2006)

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.