Investigating the existence and the regularity of logarithmic Harary graphs

DOI10.1016/j.tcs.2009.01.041zbMath1168.68034OpenAlexW2005802108MaRDI QIDQ1019190

Leonardo Querzoni, Sara Tucci Piergiovanni, Silvia Bonomi, Roberto Baldoni

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.041

zbMATH Keywords

graph constraintsflooding overlay networkslogarithmic Harary graphs

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)

Uses Software

• Mathematica
• SCRIBE
• Pastry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Araneola: a scalable reliable multicast system for dynamic environments
• Parallel concepts in graph theory
• Viceroy
• Graph Transformations
• Active and Concurrent Topology Maintenance

This page was built for publication: Investigating the existence and the regularity of logarithmic Harary graphs