Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
Defines the transmission zero forcing number as the smallest initial set that fills a graph by transmitting weight under a generalized zero forcing rule allowing multi-neighbor forcing.
The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
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)).
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)).