Some bounded degree communication networks and optimal leader election

MaRDI QIDQ5494201zbMATH OpenFDO

Authors Pradip K. Srimani, Shahram Latifi

Publication date 17 October 2006

zbMATH Keywords

Cayley networksVLSI implementation

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

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

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)