scientific article; zbMATH DE number 1093953

MaRDI QIDQ4367972zbMATH OpenFDO

Authors Zhongxi Mo

Publication date 5 January 1998

zbMATH Keywords

shortest pathssparse networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• A near-optimal algorithm for finding an optimal shortcut of a tree
• A new algorithm for the shortest-path problem
• scientific article; zbMATH DE number 2113995
• An algorithm on some shortest path of dendrogram
• scientific article; zbMATH DE number 4031714
• An optimal algorithm for the maximum-density path in a tree
• On the \(K\) shortest path trees problem
• Dual algorithms for the shortest path tree problem

Cited in

(6)

• A New Polynomially Bounded Shortest Path Algorithm
• On fast path-finding algorithms in AND-OR graphs
• scientific article; zbMATH DE number 536593 (Why is no real title available?)
• Shortest path algorithms using dynamic breadth‐first search
• An \(O(nm)\)-time network simplex algorithm for the shortest path problem
• Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem

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 Q4367972)