Optimal Node Visitation in Stochastic Digraphs

DOI10.1109/TAC.2008.2006932MaRDI QIDQ4974402zbMATH OpenOpenAlexFDO

Authors Theologos Bountourelis, Spyros Reveliotis

Publication date 8 August 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2008.2006932

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Stochastic network models in operations research (90B15) Programming involving graphs or networks (90C35) Markov and semi-Markov decision processes (90C40)

Recommendations

• Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements
• The optimal path in an Erdős-Rényi random graph
• Stochastic graph exploration with limited resources
• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
• Optimal paths in probabilistic networks
• Stochastic graph exploration
• scientific article; zbMATH DE number 3880759
• scientific article; zbMATH DE number 1984128
• The stochastic critical node problem over trees
• scientific article; zbMATH DE number 5233923

Cited in

(2)

• On polynomial cases of the unichain classification problem for Markov decision processes
• Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements

This page was built for publication: Optimal Node Visitation in Stochastic Digraphs

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