A survey on multi-loop networks.
From MaRDI portal
Publication:1874388
DOI10.1016/S0304-3975(01)00341-3zbMath1038.68004MaRDI QIDQ1874388
Publication date: 25 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (43)
Sixty years of network reliability ⋮ Greedy routing in circulant networks ⋮ PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS ⋮ Characterization of strongly regular integral circulant graphs by spectral approach ⋮ A survey on book-embedding of planar graphs ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Perfect state transfer in integral circulant graphs ⋮ Dense bipartite circulants and their routing via rectangular twisted torus ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ Decompositions of circulant-balanced complete multipartite graphs based on a novel labelling approach ⋮ FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR ⋮ On the chromatic number of integral circulant graphs ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ Well-covered circulant graphs ⋮ Minimal spread of integral circulant graphs ⋮ Parallel optimization and performance tuning on a Kunpeng cluster of genetic algorithm for synthesis of circulant networks ⋮ New results on the energy of integral circulant graphs ⋮ Unnamed Item ⋮ Cycle Kronecker products that are representable as optimal circulants ⋮ Which weighted circulant networks have perfect state transfer? ⋮ A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER ⋮ Spanning trees in directed circulant graphs and cycle power graphs ⋮ Efficient eight-regular circulants based on the Kronecker product ⋮ The game of Cops and Robber on circulant graphs ⋮ On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings ⋮ On Hamiltonian paths in distance graphs ⋮ Unnamed Item ⋮ Perfect state transfer in integral circulant graphs of non-square-free order ⋮ Long cycles and paths in distance graphs ⋮ On the existence of hyper-L triple-loop networks ⋮ Gossiping and routing in undirected triple-loop networks ⋮ Optimal routing in double loop networks ⋮ Some classes of integral circulant graphs either allowing or not allowing perfect state transfer ⋮ Rotational circulant graphs ⋮ Connectivity and diameter in distance graphs ⋮ Triple-loop networks with arbitrarily many minimum distance diagrams ⋮ On the clique number of integral circulant graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hamiltonian properties on a class of circulant interconnection networks ⋮ Effective algorithm for finding shortest paths in dense Gaussian networks ⋮ A family of efficient six-regular circulants representable as a Kronecker product
Cites Work
- Unnamed Item
- Unnamed Item
- Hamiltonian decomposition of Cayley graphs of degree 4
- Quelques problèmes de connexite dans les graphes orientes
- Distributed loop network with minimum transmission delay
- Triple loop networks with small transmission delay
- Fault-tolerant routings in double fixed-step networks
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Circulants and their connectivities
- Reliable circulant networks with minimum transmission delay
- Connectivity of circulant digraphs
- Diameters of weighted double loop networks
- Vertex Transitivity and Super Line Connectedness
- Computing the Diameter in Multiple-Loop Networks
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Extremal Problems in the Construction of Distributed Loop Networks
- The Ring Loading Problem
- Survival reliability of some double-loop networks and chordal rings
- Undirected loop networks
- Connectivity of transitive graphs
- A complementary survey on double-loop networks
This page was built for publication: A survey on multi-loop networks.
