Memory-efficient enumeration of constrained spanning trees (Q294700)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Memory-efficient enumeration of constrained spanning trees |
scientific article; zbMATH DE number 6594058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Memory-efficient enumeration of constrained spanning trees |
scientific article; zbMATH DE number 6594058 |
Statements
Memory-efficient enumeration of constrained spanning trees (English)
0 references
16 June 2016
0 references
enumeration
0 references
exhaustive search
0 references
combinatorics
0 references
optimization
0 references
algorithms
0 references
output-sensitive
0 references
graphs
0 references
spanning trees
0 references
constraints
0 references
0 references
0.7849090695381165
0 references
0.7753328084945679
0 references
0.7602531909942627
0 references
