A fast discovery algorithm for large common connected induced subgraphs (Q2274094)
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 7107295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast discovery algorithm for large common connected induced subgraphs |
scientific article; zbMATH DE number 7107295 |
Statements
A fast discovery algorithm for large common connected induced subgraphs (English)
0 references
19 September 2019
0 references
enumeration
0 references
maximal common subgraphs
0 references
isomorphisms
0 references
output sensitivity
0 references
0 references
0 references
0.8310051560401917
0 references
0.782891571521759
0 references
0.769368052482605
0 references
0.7658129930496216
0 references
0.7643221020698547
0 references
