High density graphs for processor interconnection
type: Item
instance of: scholarly article
title: High density graphs for processor interconnection
zbMATH Open document ID: 0463.68004
DOI: 10.1016/0020-0190(81)90107-1
author: Li Qiao
author: Marvin Solomon
author: Leonard Uhr
author: Will E. Leland
author: Raphael Ari Finkel
published in: Information Processing Letters
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N99
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3725659
zbMATH Keywords: multicomputer
zbMATH Keywords: computer network
zbMATH Keywords: interconnection graph
MaRDI profile type: Publication
full work available at URL: 0020-0190(81)90107-1
OpenAlex ID: W2021838712
cites work: The Indirect Binary n-Cube Microprocessor Array
cites work: Parallel concepts in graph theory
cites work: On Moore Graphs with Diameters 2 and 3
cites work: On the impossibility of certain Moore graphs
cites work: Q5183530
cites work: Q5677530
cites work: A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
cites work: On the Equivalence of Finite-State Sequential Machine Models
cites work: A Design for (d, k) Graphs
cites work: Improved Construction Techniques for (d, k) Graphs
cites work: Q5834367
cites work: Design to Minimize Diameter on Building-Block Network
cites work: The Design of Small-Diameter Networks by Local Search
description: scientific article; zbMATH DE number 3725659