Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space
From MaRDI portal
Publication:2978550
DOI10.4230/LIPIcs.FSTTCS.2014.597zbMath1360.68504OpenAlexW2277952282MaRDI QIDQ2978550
Anant Dhayal, Saurabh Sawlani, M. N. Jayalal Sarma
Publication date: 25 April 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4874/pdf/50.pdf/
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
This page was built for publication: Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space