Leader election in oriented star graphs

DOI10.1002/NET.20052zbMATH Open1101.68734OpenAlexW4239746673MaRDI QIDQ4680418FDOQ4680418

Author name not available (Why is that?)

Publication date: 1 June 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20052

Recommendations

• A note on leader election in directed split-stars and directed alternating group graphs
• Leader election in plane cellular automata, only with left-right global convention
• [[:Publication:4764019|Title not available (Why is that?)]]
• Efficient elections in chordal ring networks
• Linear election in pancake graphs

zbMATH Keywords

leader electionstar graphsmessage complexitydistributed match makingtournament scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)

Cited In (2)

• A note on leader election in directed split-stars and directed alternating group graphs
• Dimension of k-leaders

This page was built for publication: Leader election in oriented star graphs

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