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 条
  • [31] Genetic algorithm for drawing directed acyclic graphs
    Zhou, Weihua
    Huang, Jingwei
    Duan, Yuchun
    Journal of Information and Computational Science, 2007, 4 (04): : 1119 - 1125
  • [32] A recursive greedy algorithm for walks in directed graphs
    Chekuri, C
    Pál, M
    46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, : 245 - 253
  • [33] A new multi-level algorithm for balanced partition problem on large scale directed graphs
    Li, Xianyue
    Pang, Yufei
    Zhao, Chenxia
    Liu, Yang
    Dong, Qingzhen
    ADVANCES IN AERODYNAMICS, 2021, 3 (01)
  • [34] A new multi-level algorithm for balanced partition problem on large scale directed graphs
    Xianyue Li
    Yufei Pang
    Chenxia Zhao
    Yang Liu
    Qingzhen Dong
    Advances in Aerodynamics, 3
  • [35] Directed graphs requiring large numbers of shortcuts
    Hesse, W
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 665 - 669
  • [36] Acyclic Partitioning of Large Directed Acyclic Graphs
    Herrmann, Julien
    Kho, Jonathan
    Ucar, Bora
    Kaya, Kamer
    Catalyurek, Umit V.
    2017 17TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2017, : 371 - 380
  • [37] On the resistance diameters of graphs and their line graphs
    Xu, Si-Ao
    Li, Yun-Xiang
    Hua, Hongbo
    Pan, Xiang-Feng
    DISCRETE APPLIED MATHEMATICS, 2022, 306 : 174 - 185
  • [38] DIAMETERS OF RANDOM GRAPHS
    KLEE, V
    LARMAN, D
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1981, 33 (03): : 618 - 640
  • [39] DIAMETERS OF POLYHEDRAL GRAPHS
    KLEE, V
    CANADIAN JOURNAL OF MATHEMATICS, 1964, 16 (03): : 602 - &
  • [40] On ω-commuting graphs and their diameters
    Raja, P.
    Vaezpour, S. M.
    MATHEMATISCHE NACHRICHTEN, 2011, 284 (5-6) : 781 - 789
12345