scientific article; zbMATH DE number 5885701

MaRDI QIDQ2997531zbMATH OpenFDO

Authors V. A. Skorokhodov

Publication date 6 May 2011

zbMATH Keywords

finding shortest pathsweighted graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The Dirichlet problem on digraphs with nonstandard reachability
• Reachability in graph timelines
• scientific article; zbMATH DE number 5587270
• Reachability relations in digraphs
• Reachability Problems on Directed Graphs
• Reachability problems in interval-constrained and cardinality-constrained graphs
• On the optimal reachability problem of weighted timed automata
• Reachability relations and the structure of transitive digraphs
• Observabilities and reachabilities of nonlinear DEDS and coloring graphs

Cited in

(1)

• scientific article; zbMATH DE number 2016676 (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 Q2997531)