Some observations on the computational complexity of graph accessibility problem

Authors:
Jun Tarui;Seinosuke Toda
Affiliations:
Dept. Denshi-Jyouhou, University of Electro-Communications, Tokyo, Japan;Dept. Applied Mathematics, College of Humanities and Sciences, Nihon University, Tokyo, Japan
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 6
Cited 0

Complexity measures for public-key cryptosystems

SIAM Journal on Computing - Special issue on cryptography
RL⊆SC

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The vertex separation number of a graph equals its path-width

Information Processing Letters
SL ⊆L4/3

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Random walks, universal traversal sequences, and the complexity of maze problems

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Undirected connectivity in O(log/sup 1.5/n) space

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the space complexity of the (undirected) graph accessibility problem (UGAP for short). We first observe that for a given graph G, the problem can be solved deterministically in space O(sw(G)2 log2 n), where n denotes the number of nodes and sw(G) denotes the separation-width of G that is an invariant of graphs introduced in this paper. We next observe that for the class of all graphs consisting of only two paths, the problem still remains to be hard for deterministic log-space under the NC1-reducibility. This result tells us that the problem is essentially hard for deterministic log-space.