The complexity of finding optimal subgraphs to represent spatial correlation

DOI10.1007/978-3-030-92681-6_13OpenAlexW3145589608MaRDI QIDQ2149864

Jessica Enright, John Sylvester, Kitty Meeks, Duncan Lee, William Pettersson

Publication date: 29 June 2022

Full work available at URL: https://arxiv.org/abs/2010.10314

zbMATH Keywords

spatial statisticstreewidthparameterised complexitycolour coding

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Improved inference for areal unit count data using graph-based optimisation
• The Parameterized Complexity of Counting Problems
• Reducibility among Combinatorial Problems
• A Hierarchical Framework for Correcting Under-Reporting in Count Data
• Parameterized Algorithms
• Hard tiling problems with simple tiles

This page was built for publication: The complexity of finding optimal subgraphs to represent spatial correlation