On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706)
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 6065013
| 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 6065013 |
Statements
On symbolic OBDD-based algorithms for the minimum spanning tree problem (English)
0 references
13 August 2012
0 references
minimum spanning tree algorithms
0 references
ordered binary decision diagrams
0 references
symbolic algorithms
0 references
transitive closure
0 references
0.99999994
0 references
0.87580097
0 references
0.8635641
0 references
0.8634341
0 references
0.86320233
0 references
0.8630881
0 references
0.86298096
0 references
0.86222506
0 references
0.8607526
0 references
