Relating Sublinear Space Computability Among Graph Connectivity and Related Problems

We investigate sublinear-space computability relation among the directed graph vertex connectivity problem and its related problems, where by “sublinear-space computability” we mean in this paper $$O(n^{1-\varepsilon })$$ -space and polynomial-time computability w.r.t. the number n of vertices. We d...

Full description

Saved in:
Bibliographic Details
Published inSOFSEM 2016: Theory and Practice of Computer Science pp. 17 - 28
Main Authors Imai, Tatsuya, Watanabe, Osamu
Format Book Chapter
LanguageEnglish
Japanese
Published Berlin, Heidelberg Springer Berlin Heidelberg 2016
SeriesLecture Notes in Computer Science
Subjects
Graph Connectivity Problem
Graph Size Increases
Polynomial Time Computability
Space Complexity Measures
Sublinear Space Algorithms
Online AccessGet full text
ISBN9783662491911
3662491915
ISSN0302-9743
1611-3349
DOI10.1007/978-3-662-49192-8_2

Cover

More Information
Summary:We investigate sublinear-space computability relation among the directed graph vertex connectivity problem and its related problems, where by “sublinear-space computability” we mean in this paper $$O(n^{1-\varepsilon })$$ -space and polynomial-time computability w.r.t. the number n of vertices. We demonstrate algorithmic techniques to relate the sublinear-space computability of directed graph connectivity and undirected graph length bounded connectivity.
Bibliography:Original Abstract: We investigate sublinear-space computability relation among the directed graph vertex connectivity problem and its related problems, where by “sublinear-space computability” we mean in this paper \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n^{1-\varepsilon })$$\end{document}-space and polynomial-time computability w.r.t. the number n of vertices. We demonstrate algorithmic techniques to relate the sublinear-space computability of directed graph connectivity and undirected graph length bounded connectivity.
ISBN:9783662491911
3662491915
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-662-49192-8_2