A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph (Q4842123): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539793247634 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004694806 / rank | |||
Normal rank | |||
Latest revision as of 09:26, 30 July 2024
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
