scientific article; zbMATH DE number 2036580

zbMATH Open1030.68530MaRDI QIDQ4446611

Sébastien Tixeuil

Publication date: 2 February 2004

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Recommendations

• Space efficient and time optimal distributed BFS tree construction 👍 👎
• Distributed algorithms for depth-first search 👍 👎
• A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees 👍 👎
• Distributed Spanner Approximation 👍 👎
• Optimal Distributed Covering Algorithms 👍 👎
• Distributed Spanner Approximation 👍 👎
• Distributed algorithms for ultrasparse spanners and linear size skeletons 👍 👎
• Distributed algorithms for ultrasparse spanners and linear size skeletons 👍 👎
• Optimized versions of a distributed algorithm for solving path problems 👍 👎

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