Proximity Search for Maximal Subgraph Enumeration (Q5048293)
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 7617236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proximity Search for Maximal Subgraph Enumeration |
scientific article; zbMATH DE number 7617236 |
Statements
Proximity Search for Maximal Subgraph Enumeration (English)
0 references
15 November 2022
0 references
graph enumeration
0 references
polynomial delay
0 references
proximity search
0 references
output polynomial
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.89376813
0 references
0.8920677
0 references
0.8860001
0 references
0 references
0.8805121
0 references
0.8788253
0 references
0.8750496
0 references
