Conference
2026
Parameterizing the Complexity of Finding Long Paths in DAGs
This work studies the unambiguous complexity of the Long Path problem on DAGs under parameterization and obtains an algorithm that achieves unambiguous and co-unambiguous O ( k log n ) space while running in time polynomial in both n and k.
Ronak Bhadra, Saurya Singh, Raghunath Tewari
· International Symposium on M... · 0 citations