Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Deterministic algorithms for undirected
s
-
t
connectivity using polynomial time and sublinear space.
Home
Publications
Deterministic algorithms for undirected
s
-
t
connectivity using polynomial time and sublinear space.
Deterministic algorithms for undirected
s
-
t
connectivity using polynomial time and sublinear space.
Authors:
GB
Greg Barnes
Greg Barnes
WR
Walter L. Ruzzo
Walter L. Ruzzo
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Open Access
Publisher website
Google Scholar
1 January 1991
conference paper
Published by
Association for Computing Machinery (ACM)
p.
43-53
DOI:
10.1145/103418.103430
Abstract
No abstract available
Keywords
DETERMINISTIC ALGORITHM
UNDIRECTED S-T CONNECTIVITY
SUBLINEAR SPACE
POLYNOMIAL TIME
Cited
Cited by 11 articles
Scroll to top