Approximate cycles count in undirected graphs
In social networks, counting the number of different cycle sizes can be used to measure the entropy of the network that represents its robustness. The exact algorithms to compute cycles in a graph can generate exact results but they are not guaranteed to run in a polynomial time. We present an appro...
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Springer
2014-04-01
|
| Schriftenreihe: | International Journal of Computational Intelligence Systems |
| Schlagworte: | |
| Online Zugang: | https://www.atlantis-press.com/article/25868474.pdf |