Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes (Q6549667)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7859406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes |
scientific article; zbMATH DE number 7859406 |
Statements
Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes (English)
0 references
4 June 2024
0 references
enumeration
0 references
binary decision diagrams
0 references
graph isomorphism
0 references
graph classes
0 references
string representation
0 references
0 references
0 references
0 references
0 references
0.7583713531494141
0 references
0.7574597001075745
0 references
0.7554885149002075
0 references
0.7178304195404053
0 references
