A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs (Q4314146): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q60264976, #quickstatements; #temporary_batch_1707232231678 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60264976 / rank | |||
Normal rank | |||
Revision as of 17:27, 6 February 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
