scientific article; zbMATH DE number 1304097

zbMATH Open0947.68120MaRDI QIDQ4250790

Christian Lavault, Franck Butelle

Publication date: 17 June 1999

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

zbMATH Keywords

message complexityminimum diameter spanning tree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem ⋮ Distributed exact weighted all-pairs shortest paths in near-linear time

Recommendations

• Title not available (Why is that?) 👍 👎
• A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots 👍 👎
• A distributed approximation algorithm for the minimum degree minimum weight spanning trees 👍 👎
• A distributed algorithm for constructing a minimum diameter spanning tree 👍 👎
• A fast distributed approximation algorithm for minimum spanning trees 👍 👎
• Optimal distributed all pairs shortest paths and applications 👍 👎
• A Fast Distributed Approximation Algorithm for Minimum Spanning Trees 👍 👎
• Distributed algorithms for computing shortest pairs of disjoint paths 👍 👎
• A distributed algorithm for directed minimum-weight spanning tree 👍 👎

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