A Combinatorial Problem Related to Multimodule Memory Organizations

DOI10.1145/321832.321838zbMATH Open0353.68039OpenAlexW2077736855MaRDI QIDQ4124299FDOQ4124299

Authors:

Publication date: 1974

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321832.321838

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Algorithms in computer science (68W99)

Cited In (88)

The hyperbolicity constant of infinite circulant graphs
Linear layout of directed grid graph
Diameter lower bounds for Waring graphs and multiloop networks
The infinite families of optimal double loop networks
A family of efficient six-regular circulants representable as a Kronecker product
A simple algorithm to find the steps of double-loop networks
Vertex-colouring of 3-chromatic circulant graphs
Cycle Kronecker products that are representable as optimal circulants
The degree/diameter problem for mixed abelian Cayley graphs
Symmetry properties of chordal rings of degree 3
Distributed loop network with minimum transmission delay
Network(graph) data research in the coordinate system
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
Title not available (Why is that?)
Mathematical properties of the hyperbolicity of circulant networks
Abelian Cayley digraphs with asymptotically large order for any given degree
Searching for large multi-loop networks
FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
Cyclic group blocking polyhedra
New Moore-like bounds and some optimal families of abelian Cayley mixed graphs
Dense Gaussian networks: Suitable topologies for on-chip multiprocessors
New dense families of triple loop networks
Double loop networks with minimum delay
Improved upper and lower bounds on the optimization of mixed chordal ring networks
Double commutative-step digraphs with minimum diameters
A new method for constructing infinite families of \(k\)-tight optimal double loop networks
The degree-diameter problem for circulant graphs of degrees 10 and 11
The computation and communication complexity of a parallel banded system solver
Triple-loop networks with arbitrarily many minimum distance diagrams
A complementary survey on double-loop networks
A symbolical algorithm on additive basis and double-loop networks
A survey on multi-loop networks.
Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
Fault-tolerant routings in chordal ring networks
Triple loop networks with small transmission delay
Designing of optimal double loop networks
Efficient elections in chordal ring networks
Rotational circulant graphs
Fault tolerant token ring embedding in double loop networks.
Wavelength routing of uniform instances in all-optical rings
Hamiltonian numbers of Möbius double loop networks
Weighted multi-connected loop networks
Dense bipartite circulants and their routing via rectangular twisted torus
Connectedness of finite distance graphs
Optimal routing in double loop networks
Connectivity and diameter in distance graphs
Geometric proof of Rødseth's formula for Frobenius numbers
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
The existence of hyper-L triple-loop networks.
An efficient algorithm to find a double-loop network that realizes a given L-shape
An efficient algorithm to find optimal double loop networks
Connectivities of random circulant digraphs
A survey on undirected circulant graphs
Minimal diameter double-loop networks: Dense optimal families
Large fault-tolerant interconnection networks
Clique, chromatic, and Lovász numbers of certain circulant graphs
Simplified Reliabilities for Consecutive-k-out-of-nSystems
Multiplicative circulant networks. Topological properties and communication algorithms
The Hamiltonian property of the consecutive-3 digraphs
On the existence of hyper-L triple-loop networks
Large Cayley graphs on an abelian group
An improved Moore bound and some new optimal families of mixed abelian Cayley graphs
Procreating tiles of double commutative-step digraphs
Fault-tolerant routings in double fixed-step networks
The index set problem for Boolean (or nonnegative) matrices
On computation of some distance-based topological indices of circulant networks
Series of families of degree six circulant graphs
Lower Bounds on Lattice Covering Densities of Simplices
Block codes for dyadic phase shift keying
The Waring's problem over finite fields through generalized Paley graphs
New families of multiplicative circulant networks
Embedding circulant networks into butterfly and benes networks
On Motzkin's problem in the circle group
Identifying codes of degree 4 Cayley graphs over abelian groups
A set of families of analytically described triple loop networks defined by a parameter
Radio labelings of distance graphs
The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks
Greedy routing in circulant networks
Tessellating polyominos in the plane
Title not available (Why is that?)
A unique arithmetic labeling of hexagonal lattices
Cube-connected circulants: bisection width, Wiener and forwarding indices
Equivalent nondegenerate L-shapes of double-loop networks
The dilating method to obtain dense Cayley digraphs on finite abelian groups
INVERSE DOMINATION NUMBER OF CIRCULANT GRAPH
Improved bound for dilation of an embedding onto circulant networks
Primal-dual simplex method for shooting
Title not available (Why is that?)

This page was built for publication: A Combinatorial Problem Related to Multimodule Memory Organizations

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