Exposing graph uniformities via algebraic specification

DOI10.1007/BF02090777MaRDI QIDQ4712581zbMATH OpenFDO

Authors Arnold L. Rosenberg

Publication date 25 June 1992

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02090777

zbMATH Keywords

interconnection networkstransformation graphsaddressing scheme

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Abstract data types; algebraic specification (68Q65)

Recommendations

• Group Action Graphs and Parallel Architectures
• scientific article; zbMATH DE number 3948334
• Cayley graphs
• Algebraic properties of arrangement graphs
• New methods for using Cayley graphs in interconnection networks

Cites work

• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• scientific article; zbMATH DE number 3594622 (Why is no real title available?)
• scientific article; zbMATH DE number 4123276 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3284302 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A representation theorem for algebraic and context-free power series in noncommuting variables
• Addressable Data Graphs
• An extrinsic characterization of addressable data graphs
• Data graphs and addressing schemes
• Generalized addressing schemes for data graphs
• Graph theory with applications
• Group Action Graphs and Parallel Architectures
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• Minimal diameter double-loop networks. I. Large infinite optimal families
• On Group Graphs and Their Fault Tolerance
• On finite monoids having only trivial subgroups
• Parallel Processing with the Perfect Shuffle
• Suffixes of addressable data graphs
• Symmetries in Data Graphs
• The Probability of Generating the Symmetric Group
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Ultracomputers
• Uniform data encodings
• Work-preserving emulations of fixed-connection networks

Cited in

(3)

• Algebraic specification of interconnection network relationships by permutation voltage graph mappings
• scientific article; zbMATH DE number 3948334 (Why is no real title available?)
• Group Action Graphs and Parallel Architectures

This page was built for publication: Exposing graph uniformities via algebraic specification

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