On Directed Densest Subgraph Detection

被引:0
|
作者
Yao, Kai [1 ]
Yang, Xin [1 ]
Chang, Lijun [1 ]
机构
[1] Univ Sydney, Sydney, NSW, Australia
来源
基金
澳大利亚研究理事会;
关键词
Directed densest subgraph; Directed graphs;
D O I
10.1007/978-3-031-47843-7_26
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The well-studied directed densest subgraph problem aims to find two (possibly overlapping) vertex subsets S* and T* in a given directed graph G = (V, E) such that rho(S, T) = |E(S,T)|/root|S||T| is maximized; here E(S, T) denotes the set of edges from vertices of S to T in G. This problem is polynomial-time solvable, and both exact algorithms and approximation algorithms have been proposed in the literature. However, the existing exact algorithms are time-consuming, while the existing approximation algorithms often yield trivial solutions that consist of the highest-degree vertex and its in-neighbors or out-neighbors. Moreover, there is nothing special about geometric mean that is adopted in the existing density measure for combining |E(S,T)|/|S| and |E(S,T)|/|T|. In this paper, we explore alternative density measures and propose corresponding algorithms, for directed densest subgraph identification. Specifically, we introduce three density measures that combine |E(S,T)|/|S| and |E(S,T)|/|T| by harmonic mean, arithmetic mean, and minimum mean, respectively. Based on these density measures, we formulate the harmonic mean-based directed densest subgraph (HDDS) problem, the arithmetic mean-based directed densest subgraph (ADDS) problem, and the minimum meanbased directed densest subgraph (MDDS) problem. We then propose a 2-approximation algorithm for HDDS, a 2-approximation algorithm for ADDS, and a heuristic algorithm for MDDS; our HDDS and MDDS algorithms run in linear time to the input graph size. Extensive empirical studies on large real-world directed graphs show that our ADDS algorithm produces similar trivial results as the existing approximation algorithm, and our HDDS and MDDS algorithms generate nontrivial and much better solutions and scale to large graphs.
引用
收藏
页码:371 / 384
页数:14
相关论文
共 50 条
  • [31] Efficient Densest Subgraph Computation in Evolving Graphs
    Epasto, Alessandro
    Lattanzi, Silvio
    Sozio, Mauro
    PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW 2015), 2015, : 300 - 310
  • [32] Fair Densest Subgraph Across Multiple Graphs
    Arachchi, Chamalee Wickrama
    Tatti, Nikolaj
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES: RESEARCH TRACK, PT V, ECML PKDD 2024, 2024, 14945 : 3 - 19
  • [33] Spectral densest subgraph and independence number of a graph
    Andersen, Reid
    Cioba, Sebastian M.
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2007, 13 (11) : 1501 - 1513
  • [34] Densest Subgraph: Supermodularity, Iterative Peeling, and Flow
    Chekuri, Chandra
    Quanrud, Kent
    Torres, Manuel R.
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 1531 - 1555
  • [36] Densest Multipartite Subgraph Search in Heterogeneous Information Networks
    Chen, Lu
    Liu, Chengfei
    Zhou, Rui
    Liao, Kewen
    Xu, Jiajie
    Li, Jianxin
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2023, 17 (04): : 699 - 711
  • [37] PTAS for Densest k-Subgraph in Interval Graphs
    Nonner, Tim
    ALGORITHMS AND DATA STRUCTURES, 2011, 6844 : 631 - 641
  • [38] Densest k-Subgraph Approximation on Intersection Graphs
    Chen, Danny Z.
    Fleischer, Rudolf
    Li, Jian
    APPROXIMATION AND ONLINE ALGORITHMS, 2011, 6534 : 83 - 93
  • [39] Computing densest k-subgraph with structural parameters
    Tesshu Hanaka
    Journal of Combinatorial Optimization, 2023, 45
  • [40] Densest Periodic Subgraph Mining on Large Temporal Graphs
    Qin, Hongchao
    Li, Rong-Hua
    Yuan, Ye
    Dai, Yongheng
    Wang, Guoren
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (11) : 11259 - 11273