An efficient approximation algorithm for counting \(n\)-cycles in a graph (Q2474910)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5245562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient approximation algorithm for counting \(n\)-cycles in a graph |
scientific article; zbMATH DE number 5245562 |
Statements
An efficient approximation algorithm for counting \(n\)-cycles in a graph (English)
0 references
6 March 2008
0 references
number of \(n\)-cycles
0 references
graph theory
0 references
approximation
0 references
polynomial complexity
0 references
error bound
0 references
0.7634548544883728
0 references
0.74454265832901
0 references
0.7377147674560547
0 references
0.7363327145576477
0 references
