Some bounded degree communication networks and optimal leader election

zbMATH Open1115.90017MaRDI QIDQ5494201FDOQ5494201

Authors: Pradip K. Srimani, Shahram Latifi 

Publication date: 17 October 2006

Recommendations

• The space complexity of leader election in anonymous networks
• Impact of knowledge on election time in anonymous networks
• How much memory is needed for leader election
• How much memory is needed for leader election
• The complexity of leader election in diameter-two networks

zbMATH Keywords

VLSI implementationCayley networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cited In (1)

• Topology recognition and leader election in colored networks

This page was built for publication: Some bounded degree communication networks and optimal leader election

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494201)