A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph (Q4842123)
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: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph |
scientific article; zbMATH DE number 779138
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph |
scientific article; zbMATH DE number 779138 |
Statements
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph (English)
0 references
26 July 1995
0 references
counting subgraphs
0 references
regularity lemma
0 references
