Exposing graph uniformities via algebraic specification

DOI10.1007/BF02090777zbMath0735.68060MaRDI QIDQ4712581

Arnold L. Rosenberg

Publication date: 25 June 1992

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

zbMATH Keywords

interconnection networkstransformation graphsaddressing scheme

Mathematics Subject Classification ID

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

Related Items (1)

Algebraic specification of interconnection network relationships by permutation voltage graph mappings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniform data encodings
• An extrinsic characterization of addressable data graphs
• Data graphs and addressing schemes
• Group Action Graphs and Parallel Architectures
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• On Group Graphs and Their Fault Tolerance
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Ultracomputers
• Minimal diameter double-loop networks. I. Large infinite optimal families
• Generalized addressing schemes for data graphs
• The Probability of Generating the Symmetric Group
• Work-preserving emulations of fixed-connection networks
• Suffixes of addressable data graphs
• On finite monoids having only trivial subgroups
• A representation theorem for algebraic and context-free power series in noncommuting variables
• Parallel Processing with the Perfect Shuffle
• Symmetries in Data Graphs
• Addressable Data Graphs

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