scientific article; zbMATH DE number 2080918

MaRDI QIDQ4473984zbMATH OpenFDO

Authors Luboš Brim, Pavel Krčál, Radek Pelánek, I. Černá

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2234/22340191.htm

Mathematics Subject Classification ID

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

Recommendations

• Distributed computation on graphs
• Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
• A distributed shortest path algorithm for a planar network
• A bidirectional shortest-path algorithm with good average-case behavior
• A Randomized Parallel Algorithm for Single-Source Shortest Paths

Cited in

(1)

• Distributed computation on 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 Q4473984)