Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams (Q5140733)
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: Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams |
scientific article; zbMATH DE number 7286694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams |
scientific article; zbMATH DE number 7286694 |
Statements
16 December 2020
0 references
graph algorithm
0 references
graph partitioning
0 references
decision diagram
0 references
frontier-based search
0 references
enumeration problem
0 references
0.7502861022949219
0 references
0.7332082390785217
0 references
0.709153413772583
0 references
0.7079730033874512
0 references
0.7068403959274292
0 references
