Line Digraph Iterations and the (d, k) Digraph Problem (Q3309081): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tc.1984.1676455 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975203667 / rank | |||
Normal rank | |||
Latest revision as of 09:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Line Digraph Iterations and the (d, k) Digraph Problem |
scientific article |
Statements
Line Digraph Iterations and the (d, k) Digraph Problem (English)
0 references
1984
0 references
communication network
0 references
line digraph
0 references
Moore bound
0 references
routing algorithm
0 references
