scientific article; zbMATH DE number 2171034

zbMATH Open1061.05049MaRDI QIDQ4678570FDOQ4678570

I. M. Erusalimskiy, V. A. Skorokhodov

Publication date: 23 May 2005

Title of this publication is not available (Why is that?)

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)

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Viability for differential inclusions on graphs 👍 👎
• Accessibility in transitive graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)