Pages that link to "Item:Q3167054"

The following pages link to Distributed Algorithms for Network Diameter and Girth (Q3167054):

Displaying 8 items.

• A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
• Distributed finite-time calculation of node eccentricities, graph radius and graph diameter (Q286507) (← links)
• Algebraic methods in the congested clique (Q2010605) (← links)
• Fast approximate shortest paths in the congested clique (Q2064057) (← links)
• Distributed distance computation and routing with small messages (Q2422769) (← links)
• (Q5090500) (← links)
• Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
• Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)