"A reduction of the logspace shortest path problem to biconnected graphs."

Boris Brimkov (2015)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics