New polynomial delay bounds for maximal subgraph enumeration by proximity search (Q5212857)
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 7160590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New polynomial delay bounds for maximal subgraph enumeration by proximity search |
scientific article; zbMATH DE number 7160590 |
Statements
New polynomial delay bounds for maximal subgraph enumeration by proximity search (English)
0 references
30 January 2020
0 references
graph enumeration
0 references
polynomial delay
0 references
proximity search
0 references
0.9399319887161256
0 references
0.7894555330276489
0 references
0.7808412909507751
0 references
0.7804440855979919
0 references
0.7793251872062683
0 references
