Algorithms and Computation

DOI10.1007/11602613MaRDI QIDQ5897909zbMATH OpenOpenAlexFDO

Authors Pinyan Lu, Jialin Zhang, Chung Keung Poon, Jin-Yi Cai

Publication date 14 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

Connectivity (05C40) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• An $O(\logn \log\logn)$ Space Algorithm for Undirected st-Connectivity
• Tight Lower Bounds for st-Connectivity on the NNJAG Model
• An O (log( n ) ^4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs
• A space lower bound for \(st\)-connectivity on node-named JAGs
• scientific article; zbMATH DE number 1559538

Cited in

(1)

• Simulating time with square-root space

This page was built for publication: Algorithms and Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897909)