An Exact Algorithm for Diameters of Large Real Directed Graphs

被引：4
|
作者：
Akiba, Takuya [1 ]
Iwata, Yoichi [1 ]
Kawata, Yuki [1 ]
机构：
[1] Univ Tokyo, Bunkyo Ku, Tokyo 1130033, Japan
来源：
EXPERIMENTAL ALGORITHMS, SEA 2015 | 2015年 / 9125卷
关键词：
WORLD; WEB;
D O I：
10.1007/978-3-319-20086-6_5
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We propose a new algorithm to compute the diameters of large real directed graphs. In contrast to recent algorithms, the proposed algorithm is designed for general directed graphs, i.e., it does not assume that given graphs are undirected or strongly connected. Experimental results on large real graphs show that the proposed algorithm is several orders of magnitude faster than the naive approach, and it reveals the exact diameters of large real directed graphs, for which only lower bounds have been known.
引用
收藏
页码：56 / 67
页数：12
相关论文
共 50 条
  • [21] A Force-Directed Algorithm for Drawing Directed Graphs Symmetrically
    Xu, Taihua
    Yang, Jie
    Gou, Guanglei
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
  • [22] All Pairs Shortest Paths in weighted directed graphs exact and almost exact algorithms
    Zwick, U
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 310 - 319
  • [23] Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
    Chehreghani, Mostafa Haghir
    Bifet, Albert
    Abdessalem, Talel
    FUNDAMENTA INFORMATICAE, 2021, 182 (03) : 219 - 242
  • [24] Exact solution of the centralized network design problem on directed graphs
    Gzara, F
    Goffin, JL
    NETWORKS, 2005, 45 (04) : 181 - 192
  • [25] Efficient Compression on Real World Directed Graphs
    Li, Guohua
    Rao, Weixiong
    Jin, Zhongxiao
    WEB AND BIG DATA, APWEB-WAIM 2017, PT I, 2017, 10366 : 116 - 131
  • [26] Exact Sampling of Directed Acyclic Graphs from Modular Distributions
    Talvitie, Topi
    Vuoksenmaa, Aleksis
    Koivisto, Mikko
    35TH UNCERTAINTY IN ARTIFICIAL INTELLIGENCE CONFERENCE (UAI 2019), 2020, 115 : 965 - 974
  • [27] A Semi-Exact Algorithm for Quickly Computing a Maximum Weight Clique in Large Sparse Graphs
    Cai, Shaowei
    Lin, Jinkun
    Wang, Yiyuan
    Strash, Darren
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2021, 72 : 39 - 67
  • [28] A PARALLEL SEARCH ALGORITHM FOR DIRECTED ACYCLIC GRAPHS
    GHOSH, RK
    BHATTACHARJEE, GP
    BIT, 1984, 24 (02): : 134 - 150
  • [29] Optimal algorithm for cycle breaking in directed graphs
    Orenstein, Tatiana
    Kohavi, Zvi
    Pomeranz, Irith
    Journal of Electronic Testing: Theory and Applications (JETTA), 1995, 7 (1-2): : 71 - 81
  • [30] ALGORITHM FOR MINIMAL ARC BASE IN DIRECTED GRAPHS
    HEIN, O
    ANGEWANDTE INFORMATIK, 1976, (05): : 196 - 198
12345