Linear election in pancake graphs

DOI10.1016/j.ipl.2007.10.017zbMath1186.68555OpenAlexW2030787951MaRDI QIDQ963349

R. S. Ramakrishna, Adnan Mohamed

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.017

zbMATH Keywords

algorithmsinterconnection networksdistributed algorithmspancake graphelection

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (1)

Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)

Cites Work

• Unnamed Item
• Distributed match-making
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: Linear election in pancake graphs