Counting connected subgraphs with maximum-degree-aware sieving (Q5091007)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting connected subgraphs with maximum-degree-aware sieving |
scientific article; zbMATH DE number 7561371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting connected subgraphs with maximum-degree-aware sieving |
scientific article; zbMATH DE number 7561371 |
Statements
21 July 2022
0 references
graph embedding
0 references
\(k\)-path
0 references
subgraph counting
0 references
maximum degree
0 references
0 references
0 references
0.818672776222229
0 references
0.7915918827056885
0 references
0.7788907885551453
0 references
0.7777591943740845
0 references
0.777304470539093
0 references
