A fast randomized LOGSPACE algorithm for graph connectivity
type: Item
instance of: scholarly article
title: A fast randomized LOGSPACE algorithm for graph connectivity
zbMATH Open document ID: 0874.68236
DOI: 10.1016/S0304-3975(96)00118-1
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 983810
MaRDI profile type: Publication
cites work: Short Random Walks on Graphs
cites work: Two Applications of Inductive Counting for Complementation Problems
cites work: Universal classes of hash functions
cites work: Random Walks on Regular and Irregular Graphs
cites work: Q3706275
cites work: Computing with Noisy Information
cites work: Q5615108
cites work: Random walks and the effective resistance of networks
author: Uriel Feige
description: scientific article; zbMATH DE number 983810