Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata

DOI10.1137/S0097539794277135MaRDI QIDQ4210119zbMATH OpenOpenAlexFDO

Authors Jeff Edmonds

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539794277135

zbMATH Keywords

lower boundstime-space tradeoffsundirected st-connectivityJAG graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
• Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space
• Trading Space for Time in Undirected s-t Connectivity

Cited in

(1)

• Trading Space for Time in Undirected s-t Connectivity

This page was built for publication: Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata

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