Network properties of double and triple fixed step graphs

DOI10.1142/S0129054198000076MaRDI QIDQ2703016zbMATH OpenFDO

Authors Arthur L. Liestman, M. Zaragozá, Jaroslav Opatrny

Publication date 28 February 2001

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054198000076

zbMATH Keywords

fixed step graphsroutingsurviving route graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fault-tolerant routings in double fixed-step networks
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
• scientific article; zbMATH DE number 4201663
• Triple loop networks with small transmission delay
• An efficient algorithm to find optimal double loop networks

Cites work

• A survey of gossiping and broadcasting in communication networks
• EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗
• Fault-tolerant routings in double fixed-step networks

Cited in

(10)

• Fault-tolerant routings in double fixed-step networks
• Symmetry properties of chordal rings of degree 3
• Minimum chromaticity of circulant graphs
• Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
• A survey on undirected circulant graphs
• Series of families of degree six circulant graphs
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
• A set of families of analytically described triple loop networks defined by a parameter
• FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR

This page was built for publication: Network properties of double and triple fixed step graphs

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