scientific article; zbMATH DE number 2171034

MaRDI QIDQ4678570zbMATH OpenFDO

Authors I. M. Erusalimskiy, V. A. Skorokhodov

Publication date 23 May 2005

zbMATH Keywords

arcshortest pathamplificationoriented graphdamping level

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 8782
• scientific article; zbMATH DE number 3857162
• Viability for differential inclusions on graphs
• Accessibility in transitive graphs
• scientific article; zbMATH DE number 5655990
• Accessibility and ends of graphs
• Accessible spectrum of graphs
• Accessibility percolation on Cartesian power graphs
• Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games
• Random Accessibility as a Parallelism to Reliability Studies on Simple Graphs

Cited in

(1)

• scientific article; zbMATH DE number 1892799 (Why is no real title available?)

This page was built for publication:

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