On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q3066440)
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 5834491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On symbolic OBDD-based algorithms for the minimum spanning tree problem |
scientific article; zbMATH DE number 5834491 |
Statements
On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem (English)
0 references
10 January 2011
0 references
minimum spanning tree algorithms
0 references
ordered binary decision diagrams
0 references
symbolic algorithms
0 references
0.991006076335907
0 references
0.789731502532959
0 references
0.7828147411346436
0 references
0.7807714343070984
0 references
0.7807452082633972
0 references
