Decomposable trees: A polynomial algorithm for tripodes (Q1613342): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q5615282 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(00)00322-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053543588 / rank | |||
Normal rank | |||
Latest revision as of 10:29, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposable trees: A polynomial algorithm for tripodes |
scientific article |
Statements
Decomposable trees: A polynomial algorithm for tripodes (English)
0 references
29 August 2002
0 references
polynomial algorithm
0 references
graphs modelling interconnection networks
0 references
