Random Walks on Some Basic Classes of Digraphs

DOI10.1007/978-3-642-39718-9_8zbMath1405.68136OpenAlexW136561946MaRDI QIDQ2851903

Wen-Ju Cheng, Stathis Zachos, Jim Cox

Publication date: 4 October 2013

Published in: Theoretical Aspects of Computing – ICTAC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39718-9_8

zbMATH Keywords

reachabilityrandom walksstrong connectivityBPLNLLdigraph searchRLspace-bounded complexity classessymmetric computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Directed graphs (digraphs), tournaments (05C20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Connectivity (05C40) Randomized algorithms (68W20) Random walks on graphs (05C81)

Related Items (1)

Random walks on graphs and Monte Carlo methods

This page was built for publication: Random Walks on Some Basic Classes of Digraphs