Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3122914
Jump to:navigation, search

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2<205::AID-RSA11>3.0.CO;2-7" /><205::AID-RSA11>3.0.CO;2-7 10.1002/(SICI)1098-2418(199701/03)10:1/2<205::AID-RSA11>3.0.CO;2-7zbMath0867.68058MaRDI QIDQ3122914

Volker Priebe, Kurt Mehlhorn

Publication date: 5 March 1997


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

weighted digraphsshortest-path


Mathematics Subject Classification ID

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


Related Items (5)

Unnamed Item ⋮ Average-case complexity of the min-sum matrix product problem ⋮ A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time ⋮ A Forward-Backward Single-Source Shortest Paths Algorithm ⋮ Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time






This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3122914&oldid=16211204"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki