Approximate Cycles Count in Undirected Graphs

被引：0
|
作者：
Maytham Safar
Khaled Mahdi
Hisham Farahat
Saud Albehairy
Ali Kassem
Khalid Alenzi
机构：
[1] College of Eng. & Petroleum,Computer Eng. Dept.
[2] Kuwait University,Chemical Eng. Dept.
[3] College of Eng. & Petroleum,undefined
[4] Kuwait University,undefined
来源：
International Journal of Computational Intelligence Systems | 2014年 / 7卷
关键词：
Complex networks; social networks; cyclic entropy; cycles;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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 approximation algorithm for counting the number of cycles in an undirected graph. The algorithm is regression-based and guaranteed to run in a polynomial time. A set of experiments are conducted to compare the results of our approximate algorithm with the results of an exact algorithm based on the Donald-Johnson backtracking algorithm.
引用
收藏
页码：305 / 311
页数：6
相关论文
共 50 条
  • [21] DYNAMIC APPROXIMATE ALL-PAIRS SHORTEST PATHS IN UNDIRECTED GRAPHS
    Roditty, Liam
    Zwick, Uri
    [J]. SIAM JOURNAL ON COMPUTING, 2012, 41 (03) : 670 - 683
  • [22] Methods for determining cycles of a specific length in undirected graphs with edge weights
    Lewis, R.
    Corcoran, P.
    Gagarin, A.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 46 (05)
  • [23] Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs
    Fox, Kyle
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 352 - 364
  • [24] Semidefinite relaxations for approximate inference on graphs with cycles
    Wainwright, MJ
    Jordan, MI
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16, 2004, 16 : 369 - 376
  • [25] Methods for determining cycles of a specific length in undirected graphs with edge weights
    R. Lewis
    P. Corcoran
    A. Gagarin
    [J]. Journal of Combinatorial Optimization, 2023, 46
  • [26] Semidefinite methods for approximate inference on graphs with cycles
    Wainwright, MJ
    Jordan, MI
    [J]. 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 248 - 248
  • [27] FASTER ALGORITHMS FOR ALL-PAIRS APPROXIMATE SHORTEST PATHS IN UNDIRECTED GRAPHS
    Baswana, Surender
    Kavitha, Telikepalli
    [J]. SIAM JOURNAL ON COMPUTING, 2010, 39 (07) : 2865 - 2896
  • [28] A New Algebraic Approach to Finding all Simple Paths and Cycles in Undirected Graphs
    Yang, Runtao
    Gao, Rui
    Zhang, Chengjin
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, 2015, : 1887 - 1892
  • [29] Distribution of the number of cycles in directed and undirected random regular graphs of degree 2
    Tishby, Ido
    Biham, Ofer
    Katzav, Eytan
    Kuhn, Reimer
    [J]. PHYSICAL REVIEW E, 2023, 107 (02)
  • [30] Multiplicities of sums in the explicit formulae for counting fixed length cycles in undirected graphs
    Voropaev, A. N.
    [J]. PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2011, 14 (04): : 42 - 55
12345