Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams (Q6487604)
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 all subgraphs under given constraints using zero-suppressed sentential decision diagrams |
scientific article; zbMATH DE number 7651073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams |
scientific article; zbMATH DE number 7651073 |
Statements
Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams (English)
0 references
7 February 2023
0 references
subgraph enumeration
0 references
decision diagram
0 references
zero-suppressed sentential decision diagram
0 references
top-down construction algorithm
0 references
0.7335780262947083
0 references
0.7332082390785217
0 references
0.7230964303016663
0 references
0.718299150466919
0 references
0.7171639800071716
0 references
