A Combinatorial Problem Related to Multimodule Memory Organizations
From MaRDI portal
Publication:4124299
Cited in
(88)- The hyperbolicity constant of infinite circulant graphs
- Linear layout of directed grid graph
- On computation of some distance-based topological indices of circulant networks
- Diameter lower bounds for Waring graphs and multiloop networks
- The infinite families of optimal double loop networks
- Series of families of degree six circulant graphs
- A family of efficient six-regular circulants representable as a Kronecker product
- Lower Bounds on Lattice Covering Densities of Simplices
- 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
- Block codes for dyadic phase shift keying
- The degree/diameter problem for mixed abelian Cayley graphs
- The Waring's problem over finite fields through generalized Paley graphs
- Embedding circulant networks into butterfly and benes networks
- New families of multiplicative circulant networks
- Symmetry properties of chordal rings of degree 3
- Distributed loop network with minimum transmission delay
- Mathematical properties of the hyperbolicity of circulant networks
- Abelian Cayley digraphs with asymptotically large order for any given degree
- Network(graph) data research in the coordinate system
- Searching for large multi-loop networks
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- scientific article; zbMATH DE number 7310217 (Why is no real title available?)
- On Motzkin's problem in the circle group
- Cyclic group blocking polyhedra
- Dense Gaussian networks: Suitable topologies for on-chip multiprocessors
- FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR
- New Moore-like bounds and some optimal families of abelian Cayley mixed graphs
- 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
- New dense families of triple loop networks
- Improved upper and lower bounds on the optimization of mixed chordal ring networks
- Greedy routing in circulant networks
- Double loop networks with minimum delay
- 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 symbolical algorithm on additive basis and double-loop networks
- A complementary survey on 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
- Triple loop networks with small transmission delay
- Tessellating polyominos in the plane
- Fault-tolerant routings in chordal ring networks
- Designing of optimal double loop networks
- scientific article; zbMATH DE number 7310081 (Why is no real title available?)
- Efficient elections in chordal ring networks
- Rotational circulant graphs
- Wavelength routing of uniform instances in all-optical rings
- Hamiltonian numbers of Möbius double loop networks
- Fault tolerant token ring embedding in double loop networks.
- Weighted multi-connected loop networks
- Dense bipartite circulants and their routing via rectangular twisted torus
- Optimal routing in double loop networks
- Connectedness of finite distance graphs
- A unique arithmetic labeling of hexagonal lattices
- Geometric proof of Rødseth's formula for Frobenius numbers
- Connectivity and diameter in distance graphs
- The existence of hyper-L triple-loop networks.
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- Connectivities of random circulant digraphs
- An efficient algorithm to find a double-loop network that realizes a given L-shape
- An efficient algorithm to find optimal double loop networks
- A survey on undirected circulant graphs
- Minimal diameter double-loop networks: Dense optimal families
- Cube-connected circulants: bisection width, Wiener and forwarding indices
- Equivalent nondegenerate L-shapes of double-loop networks
- Large fault-tolerant interconnection networks
- Clique, chromatic, and Lovász numbers of certain circulant graphs
- The dilating method to obtain dense Cayley digraphs on finite abelian groups
- Multiplicative circulant networks. Topological properties and communication algorithms
- Simplified Reliabilities for Consecutive-k-out-of-nSystems
- The Hamiltonian property of the consecutive-3 digraphs
- On the existence of hyper-L triple-loop networks
- INVERSE DOMINATION NUMBER OF CIRCULANT GRAPH
- 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
- Improved bound for dilation of an embedding onto circulant networks
- Primal-dual simplex method for shooting
- scientific article; zbMATH DE number 1286212 (Why is no real title available?)
- The index set problem for Boolean (or nonnegative) matrices
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)
