Pages that link to "Item:Q5197673"
From MaRDI portal
The following pages link to Round- and Message-Optimal Distributed Graph Algorithms (Q5197673):
Displaying 13 items.
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- Optimal distributed algorithms in unlabeled tori and chordal rings (Q1384522) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- A Class of Optimal Structures for Node Computations in Message Passing Algorithms (Q5030271) (← links)
- (Q5090924) (← links)
- Minor Excluded Network Families Admit Fast Distributed Algorithms (Q5197712) (← links)
- Distributed Algorithms for Planar Networks I (Q5361912) (← links)
- A novel pseudo‐polynomial approach for shortest path problems (Q6087148) (← links)
- A note on the message complexity of Cidon's distributed depth-first search algorithm (Q6163898) (← links)
- Singularly optimal randomized leader election (Q6535020) (← links)
- Distributed planar reachability in nearly optimal time (Q6535037) (← links)