No label defined (Q4804969)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1908099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1908099 |
Statements
9 July 2003
0 references
digraph
0 references
0.916946291923523
0 references
0.8784721493721008
0 references
0.8744491338729858
0 references
0.8708006143569946
0 references
0.8557314872741699
0 references
A weighted double loop network is a special kind of digraph, the vertex set \(V\) of which is the set of residue classes modulo \(n\). There are two kinds of directed edges: \[ i\to i+a\pmod n,\quad o\to i+b\pmod n \] for \(i\in V\) and \(a,b\in Z\). The digraph is required to be strongly connected. In addition, the edges are also assigned the positive weights \(l,k\), \[ i @>l>> i+a\pmod n,\quad i @>k>> i+b\pmod n. \] Given \(n,a,b,l,k\), the paper presents an algorithm for the calculation of the diameter and the average diameter of the network. The number of operations needed by this algorithm is \(O(n\log^2n)\). Also, given \(n,l,k\), the paper constructs a pair \(a,b\), which makes the diameter and/or average diameter small.
0 references