Periodic dynamic graphs. Random walks problem and the shortest path

MaRDI QIDQ3647995zbMATH OpenFDO

Authors M. V. Kuz'Minova

Publication date 24 November 2009

zbMATH Keywords

graph theoryperiodic dynamic graphsshortest path problem

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Recommendations

• Periodic dynamic graphs. Maximum flow problem
• Maximal paths in random dynamic graphs
• Shortest paths on dynamic graphs
• scientific article; zbMATH DE number 3871422
• scientific article; zbMATH DE number 878897

Cited in

(8)

• An optimal algorithm for the period of a strongly connected digraph
• scientific article; zbMATH DE number 3871422 (Why is no real title available?)
• Periodic paths on nonautonomous graphs
• scientific article; zbMATH DE number 1380616 (Why is no real title available?)
• Traveling in Networks with Blinking Nodes
• Graph algorithms for dynamical systems
• Structural, Syntactic, and Statistical Pattern Recognition
• Issues of dynamic graph theory

This page was built for publication: Periodic dynamic graphs. Random walks problem and the shortest path

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