On handling vertex deletion in updating minimum spanning trees (Q1104108)
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 4055069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On handling vertex deletion in updating minimum spanning trees |
scientific article; zbMATH DE number 4055069 |
Statements
On handling vertex deletion in updating minimum spanning trees (English)
0 references
1988
0 references
vertex deletion
0 references
updating of minimum spanning trees
0 references
parallel graph algorithm
0 references
incremental algorithm
0 references
parallel computation
0 references
