An efficient approximation algorithm for counting \(n\)-cycles in a graph (Q2474910)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient approximation algorithm for counting \(n\)-cycles in a graph |
scientific article |
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
