Presents O(nr²) DP algorithms for r-edge and r-facility interdiction covering on trees (and bounded treewidth for the edge version), proves RFIC NP-complete, and gives an O(n³) algorithm for SSBVE on trees.
Church, Maria P
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
M-CaStLe generalizes local stencil-based causal discovery to the multivariate case and decomposes resulting graphs into reaction and spatial components for interpretation in space-time gridded data.
citing papers explorer
-
Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
Presents O(nr²) DP algorithms for r-edge and r-facility interdiction covering on trees (and bounded treewidth for the edge version), proves RFIC NP-complete, and gives an O(n³) algorithm for SSBVE on trees.
-
M-CaStLe: Uncovering Local Causal Structures in Multivariate Space-Time Gridded Data
M-CaStLe generalizes local stencil-based causal discovery to the multivariate case and decomposes resulting graphs into reaction and spatial components for interpretation in space-time gridded data.