"Reachability in O(log n) Genus Graphs is in Unambiguous Logspace."

Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari (2019)

Details and statistics

DOI: 10.4230/LIPICS.STACS.2019.34

access: open

type: Conference or Workshop Paper

metadata version: 2021-10-14

a service of  Schloss Dagstuhl - Leibniz Center for Informatics