Minimizing diameters of dynamic trees (Q4571959): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A simple parallel algorithm for computing the diameters of all vertices in a tree and its application / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maintaining spanning trees of small diameter / rank | |||
Normal rank | |||
Latest revision as of 01:29, 16 July 2024
scientific article; zbMATH DE number 6898382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing diameters of dynamic trees |
scientific article; zbMATH DE number 6898382 |
Statements
Minimizing diameters of dynamic trees (English)
0 references
4 July 2018
0 references
