A new algorithm for the minimum spanning tree verification problem (Q2340495)
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 6427299
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for the minimum spanning tree verification problem |
scientific article; zbMATH DE number 6427299 |
Statements
A new algorithm for the minimum spanning tree verification problem (English)
0 references
20 April 2015
0 references
minimum spanning tree
0 references
verification
0 references
graph theory
0 references
depth-first search
0 references
certification
0 references
0 references
0 references
0.8876661658287048
0 references
0.884072482585907
0 references
0.8794903755187988
0 references
0.8784028887748718
0 references
