The complexity of finding and enumerating optimal subgraphs to represent spatial correlation (Q6623585)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of finding and enumerating optimal subgraphs to represent spatial correlation |
scientific article; zbMATH DE number 7931151
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding and enumerating optimal subgraphs to represent spatial correlation |
scientific article; zbMATH DE number 7931151 |
Statements
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation (English)
0 references
24 October 2024
0 references
parameterised complexity
0 references
treewidth
0 references
colour coding
0 references
spatial statistics
0 references
enumeration
0 references
0 references
