An algorithm to construct independent spanning trees on parity cubes (Q1929242): 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.1016/j.tcs.2012.08.020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977478067 / rank | |||
Normal rank | |||
Revision as of 22:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to construct independent spanning trees on parity cubes |
scientific article |
Statements
An algorithm to construct independent spanning trees on parity cubes (English)
0 references
7 January 2013
0 references
independent spanning tree
0 references
fault-tolerant broadcasting
0 references
secure message distribution
0 references
parity cube
0 references
