On forwarding indices of networks
From MaRDI portal
Publication:1823868
DOI10.1016/0166-218X(89)90022-XzbMath0681.90077OpenAlexW1975667020MaRDI QIDQ1823868
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(89)90022-x
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38)
Related Items (66)
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs ⋮ On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ The edge-forwarding index or orbital regular graphs ⋮ Cyclotomic graphs and perfect codes ⋮ Upper bounds for the forwarding indices of communication networks ⋮ The forwarding indices of augmented cubes ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ The Forwarding Indices of Random Graphs ⋮ On quasi-Cayley graphs ⋮ FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR ⋮ Large fault-tolerant interconnection networks ⋮ Spectral bounds for the betweenness of a graph ⋮ On orbital regular graphs and Frobenius graphs ⋮ Edge-foreward index of star graphs and other Cayley graphs ⋮ The forwarding index of directed networks ⋮ On the edge-forwarding indices of Frobenius graphs ⋮ Communication throughput of interconnection networks ⋮ Simulation of utilization and energy saving of the Angara interconnect ⋮ Bisecting de Bruijn and Kautz graphs ⋮ Optimal wavelength-routed multicasting ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ Balancing Traffic Load Using One-Turn Rectilinear Routing ⋮ On Canonical Concurrent Flows, Crossing Number and Graph Expansion ⋮ The undirected optical indices of complete \(m\)-ary trees ⋮ Symmetry properties of chordal rings of degree 3 ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ Expanding and forwarding parameters of product graphs ⋮ A survey on Knödel graphs. ⋮ Echo: a peer-to-peer clustering framework for improving communication in DHTs ⋮ A parameter linked with \(G\)-factors and the binding number ⋮ Grid spanners with low forwarding index for energy efficient networks ⋮ Optimal routing in toroidal networks ⋮ Recursive cubes of rings as models for interconnection networks ⋮ The optimal routing of augmented cubes ⋮ The forwarding index of communication networks with given connectivity ⋮ Forwarding indices of \(k\)-connected graphs ⋮ Metaheuristics for computing the forwarding index of a graph* ⋮ Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem ⋮ Virtual network embedding in the cycle ⋮ Forwarding indices of folded \(n\)-cubes ⋮ On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs ⋮ Low-congested interval routing schemes for hypercubelike networks ⋮ On \(f\)-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes ⋮ The forwarding indices of wrapped butterfly networks ⋮ Gossiping and routing in undirected triple-loop networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Forwarding and optical indices of a graph ⋮ Forwarding index of cube-connected cycles ⋮ On the restricted forwarding index problem in communication networks ⋮ Algebraic connectivity of directed graphs ⋮ Rotational circulant graphs ⋮ Expanding and forwarding ⋮ Two remarks on ``Expanding and forwarding by P. Solé ⋮ The forwarding diameter of graphs ⋮ Average distances and distance domination numbers ⋮ On forwarding indices of networks ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Unnamed Item ⋮ A survey on interval routing ⋮ On the complexity of multi-dimensional interval routing schemes ⋮ Efficient collective communciation in optical networks ⋮ Symmetric routings of the hypercube ⋮ Optical Routing of Uniform Instances in Cayley Graphs ⋮ Static and dynamic low-congested interval routing schemes ⋮ A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS ⋮ Directed virtual path layouts in ATM networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parameter linked with \(G\)-factors and the binding number
- Forwarding indices of \(k\)-connected graphs
- On forwarding indices of networks
- The forwarding index of communication networks
- On the sum of all distances in a graph or digraph
- Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs
This page was built for publication: On forwarding indices of networks
