scientific article; zbMATH DE number 7310081

MaRDI QIDQ5150427

Eh. A. Monakhova

Publication date: 15 February 2021

Full work available at URL: http://mathnet.ru/eng/pdm339

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

diameterinterconnection networkscirculant graphsroutingbroadcasting and gossiping

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Related Items (4)

NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS ⋮ A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS ⋮ A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER ⋮ Effective algorithm for finding shortest paths in dense Gaussian networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameter lower bounds for Waring graphs and multiloop networks
• Modeling hexagonal constellations with Eisenstein-Jacobi graphs
• Optimal routing in double loop networks
• On broadcasting in unicyclic graphs
• Hamiltonian decomposition of Cayley graphs of degree 4
• Isomorphisms of Cayley multigraphs of degree 4 on finite Abelian groups
• Fault-tolerant routing in circulant networks and cycle prefix networks
• Triple loop networks with small transmission delay
• On Ádám's conjecture for circulant graphs
• Multiplicative circulant networks. Topological properties and communication algorithms
• Fault-tolerant routings in double fixed-step networks
• Recognizing circulant graphs of prime order in polynomial time
• A survey on interval routing
• On the spectral Ádám property for circulant graphs
• On isomorphisms of finite Cayley graphs---a survey
• A survey on multi-loop networks.
• Cyclic graphs
• Enumeration of cyclic graphs and cyclic designs
• NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS
• Minimal diameter double-loop networks: Dense optimal families
• Circulants and their connectivities
• A combinatorial problem related to distributed loop networks
• Reliable circulant networks with minimum transmission delay
• A survey of gossiping and broadcasting in communication networks
• Design to Minimize Diameter on Building-Block Network
• Minimal diameter double-loop networks. I. Large infinite optimal families
• Computing the Diameter in Multiple-Loop Networks
• A Combinatorial Problem Related to Multimodule Memory Organizations
• The Design of Small-Diameter Networks by Local Search
• Extremal Problems in the Construction of Distributed Loop Networks
• Codes over tori
• Triple Loop Networks with Minimal Transmission Delay
• Fault-tolerant routing in distributed loop networks
• Fault-tolerant routings in chordal ring networks
• Modeling Toroidal Networks with the Gaussian Integers
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• Undirected loop networks
• Reliable broadcasting in double loop networks
• Optimal distance networks of low degree for parallel computers
• Point-symmetric graphs with a prime number of points
• The Organization of High-Speed Memory for Parallel Block Transfer of Data
• Graphs with circulant adjacency matrices
• Fault-tolerant broadcasting and gossiping in communication networks
• LATIN 2004: Theoretical Informatics
• A complementary survey on double-loop networks
• All-to-all optical routing in chordal rings of degree 4

This page was built for publication: