A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs (Q4314146): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548300001188 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108932844 / rank | |||
Normal rank | |||
Latest revision as of 11:10, 30 July 2024
scientific article; zbMATH DE number 690966
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs |
scientific article; zbMATH DE number 690966 |
Statements
A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs (English)
0 references
20 November 1994
0 references
randomised approximation algorithm
0 references
randomised approximation scheme
0 references
counting the number of forests
0 references
dense graph
0 references
