PAFP is FPT by BFS-width plus backward arcs in the union digraph and polynomial-time solvable via 2-SAT for DAGs of exact-length width 2, with matching NP-hardness for width 3.
Journal of Algorithms12(2), 308–340 (1991)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A neuron-astrocyte network with dual-timescale memory reduces median path lengths up to sixfold in partially observable grid-world navigation tasks.
citing papers explorer
-
Layer-Based Width for PAFP
PAFP is FPT by BFS-width plus backward arcs in the union digraph and polynomial-time solvable via 2-SAT for DAGs of exact-length width 2, with matching NP-hardness for width 3.
-
Dual-Timescale Memory in a Spiking Neuron-Astrocyte Network for Efficient Navigation
A neuron-astrocyte network with dual-timescale memory reduces median path lengths up to sixfold in partially observable grid-world navigation tasks.