Oriented hypercubes

DOI10.1002/NET.10012MaRDI QIDQ4537616zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, Jean-Claude König, 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

orientationsbroadcastingoriented hypercube

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Recommendations

• Network Orientation
• Optimal permutation routing for low-dimensional hypercubes
• On Oriented Embedding of the Binary Tree into the Hypercube
• The bicube: an interconnection of two hypercubes
• Some permutation routing algorithms for low-dimensional hypercubes

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1769329 (Why is no real title available?)
• A simple proof of Menger's theorem
• A survey of gossiping and broadcasting in communication networks
• Antepenultimate broadcasting
• Broadcasting in a hypercube when some calls fail
• Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
• Diameter-preserving orientations of the torus
• Distances in orientations of graphs
• Fast Gossiping for the Hypercube
• Fast information sharing in a complete network
• Gossiping in Minimal Time
• Methods and problems of communication in usual networks
• On optimal orientations of Cartesian products with a bipartite graph
• Orientations of the n-cube with minimum diameter
• Quick gossiping by telegraphs
• Some minimum gossip graphs
• Topological properties of the directional hypercube

Cited in

(9)

• Vertical order in the Hilbert cube
• On recursively directed hypercubes
• Hypercube related polytopes
• On the skew energy of orientations of hypercubes
• A New Property of Hamming Graphs and Mesh of d-ary Trees
• On Eulerian orientations of even-degree hypercubes
• The number of unique-sink orientations of the hypercube
• Cubes and orientability
• Hypercube orientations with only two in-degrees

This page was built for publication: Oriented hypercubes

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