On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2011.11.029 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2011.11.029 / rank | |||
Normal rank | |||
Latest revision as of 17:46, 9 December 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
