The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus.

Klaus Kriegel

Browse the full MFCS paper archive.