The f-Critical Set problem is NP-complete on planar subcubic bipartite graphs with m(f)=2, W[1]-hard parameterized by treewidth alone, yet FPT parameterized by treewidth plus m(f) or Δ(G), with kernels of size O(k·m(f)) and O(k·Δ(G)).
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2verdicts
UNVERDICTED 2representative citing papers
The paper proposes and analyzes a distributed perception mechanism in Friedkin-Johnsen networks that enables convergence to true social power through local interactions in static and reflected-appraisal settings.
citing papers explorer
-
Parameterized complexity of the f-Critical Set problem
The f-Critical Set problem is NP-complete on planar subcubic bipartite graphs with m(f)=2, W[1]-hard parameterized by treewidth alone, yet FPT parameterized by treewidth plus m(f) or Δ(G), with kernels of size O(k·m(f)) and O(k·Δ(G)).
-
Dynamical models for distributed social power perception in Friedkin-Johnsen influence networks
The paper proposes and analyzes a distributed perception mechanism in Friedkin-Johnsen networks that enables convergence to true social power through local interactions in static and reflected-appraisal settings.