Pages that link to "Item:Q5197688"
From MaRDI portal
The following pages link to Leader Election in Well-Connected Graphs (Q5197688):
Displayed 4 items.
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- Improved deterministic leader election in diameter-two networks (Q6057346) (← links)