Using weighted graphs features for fast searching their parameters

MaRDI QIDQ5150529zbMATH OpenFDO

Authors A. R. Urakov, T. V. Timeryaev

Publication date 15 February 2021

Full work available at URL http://mathnet.ru/eng/pdm368

zbMATH Keywords

all-pairs shortest path matrixgraph centergraph diametergraph featuresgraph radiusweighted graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
• An algorithm for finding the absolute center of a network
• Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
• On the all-pairs-shortest-path problem in unweighted undirected graphs.
• Shortest paths in fuzzy weighted graphs

Cites work

• All pairs shortest distances for graphs with small integer length edges
• Efficient Algorithms for Shortest Paths in Sparse Networks

Cited in

(1)

• All-pairs shortest paths algorithm for high-dimensional sparse graphs

This page was built for publication: Using weighted graphs features for fast searching their parameters

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