On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:11, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On symbolic OBDD-based algorithms for the minimum spanning tree problem |
scientific article |
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
