On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.029 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2038076813 / rank | |||
Normal rank |
Revision as of 01:17, 20 March 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