Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254)
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 7405969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs |
scientific article; zbMATH DE number 7405969 |
Statements
Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (English)
0 references
4 October 2021
0 references
distance-hereditary graph
0 references
enumeration
0 references
graph isomorphism
0 references
Ptolemaic graph
0 references
0 references
0.9133100509643556
0 references
0.7879481911659241
0 references
0.7876272797584534
0 references
0.7628542184829712
0 references
0.7620816826820374
0 references
