On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6065013 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimum spanning tree algorithms | |||
| Property / zbMATH Keywords: minimum spanning tree algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
ordered binary decision diagrams | |||
| Property / zbMATH Keywords: ordered binary decision diagrams / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
symbolic algorithms | |||
| Property / zbMATH Keywords: symbolic algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
transitive closure | |||
| Property / zbMATH Keywords: transitive closure / rank | |||
Normal rank | |||
Revision as of 01:39, 30 June 2023
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
