Oriented hypercubes

DOI10.1002/net.10012zbMath0998.05025MaRDI QIDQ4537616

Pierre Fraigniaud, Jean-Claude Konig, Emmanuel Lazard

Publication date: 1 July 2002

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

orientations; broadcasting; oriented hypercube

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68W10: Parallel algorithms in computer science

05C20: Directed graphs (digraphs), tournaments

Related Items

A New Property of Hamming Graphs and Mesh of d-ary Trees

Cites Work

• Topological properties of the directional hypercube
• Orientations of the n-cube with minimum diameter
• Broadcasting in a hypercube when some calls fail
• Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
• Fast information sharing in a complete network
• Distances in orientations of graphs
• Quick gossiping by telegraphs
• Methods and problems of communication in usual networks
• On optimal orientations of Cartesian products with a bipartite graph
• A simple proof of Menger's theorem
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Fast Gossiping for the Hypercube
• Antepenultimate broadcasting
• Some minimum gossip graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item