Dense edge-disjoint embedding of complete binary trees in the hypercube (Q2365823): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992991 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4002466 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90044-a / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001791680 / rank | |||
Normal rank | |||
Latest revision as of 09:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dense edge-disjoint embedding of complete binary trees in the hypercube |
scientific article |
Statements
Dense edge-disjoint embedding of complete binary trees in the hypercube (English)
0 references
29 June 1993
0 references
parallel algorithms
0 references
graph embedding
0 references
complete binary tree
0 references
hybercube
0 references
