"The Complexity of Finding and Enumerating Optimal Subgraphs to Represent ..."

Jessica A. Enright et al. (2024)

> Home

Details and statistics

DOI: 10.1007/S00453-024-01256-X

access: open

type: Journal Article

metadata version: 2024-12-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/EnrightLMPS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/EnrightLMPS24
Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester:
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation. Algorithmica 86(10): 3186-3230 (2024)

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.