"The Subtree Max Gap Problem with Application to Parallel String Covering."

Omer Berkman, Costas S. Iliopoulos, Kunsoo Park (1995)

> Home

Details and statistics

DOI: 10.1006/INCO.1995.1162

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/BerkmanIP95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/BerkmanIP95
Omer Berkman, Costas S. Iliopoulos, Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering. Inf. Comput. 123(1): 127-137 (1995)

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.