Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866)
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 1766387
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring all directed paths in a symmetric tree, with an application to optical networks |
scientific article; zbMATH DE number 1766387 |
Statements
Coloring all directed paths in a symmetric tree, with an application to optical networks (English)
0 references
11 July 2002
0 references
application
0 references
symmetric directed tree
0 references
directed paths
0 references
coloring
0 references
colors
0 references
routing
0 references
gossiping
0 references
optical networks
0 references
0.9567115902900696
0 references
0.8423294425010681
0 references
0.8130580186843872
0 references
0.8091838359832764
0 references
