Incremental distributed asynchronous algorithm for minimum spanning trees (Q4280709)
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 510185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incremental distributed asynchronous algorithm for minimum spanning trees |
scientific article; zbMATH DE number 510185 |
Statements
Incremental distributed asynchronous algorithm for minimum spanning trees (English)
0 references
24 February 1994
0 references
communication networks
0 references
incremental algorithms
0 references
vertex insertion
0 references
distributed algorithm
0 references
minimum spanning tree
0 references
0.8498565554618835
0 references
0.837023913860321
0 references
