"A remark on the time complexity of the subtree problem."

Manfred P. Stadel (1978)

> Home

Details and statistics

DOI: 10.1007/BF02252027

access: closed

type: Journal Article

metadata version: 2020-08-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computing/Stadel78
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computing/Stadel78
Manfred P. Stadel:
A remark on the time complexity of the subtree problem. Computing 19(4): 297-302 (1978)

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.