Edge Connectivity-Based Graph Decomposition

  • Lijun Chang
  • Lu Qin
Part of the Springer Series in the Data Sciences book series (SSDS)


In this chapter, we study edge connectivity-based graph decomposition; that is, each subgraph satisfies a certain edge connectivity requirement.


  1. 3.
    Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction. In Proc. CIKM’13, pages 909–918, 2013.Google Scholar
  2. 14.
    Lijun Chang. A near-optimal algorithm for edge connectivity-based hierarchical graph decomposition. CoRR, abs/1711.09189, 2017.Google Scholar
  3. 16.
    Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, and Wenjie Zhang. Index-based optimal algorithms for computing Steiner components with maximum connectivity. In Proc. of SIGMOD’15, 2015.Google Scholar
  4. 17.
    Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, and Weifa Liang. Efficiently computing k-edge connected components via graph decomposition. In Proc. SIGMOD’13, pages 205–216, 2013.Google Scholar
  5. 32.
    Alan Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.Google Scholar
  6. 52.
    Yuan Li, Yuhai Zhao, Guoren Wang, Feida Zhu, Yubao Wu, and Shengle Shi. Effective k-vertex connected component detection in large-scale networks. In Proc. of DASFAA’17, pages 404–421, 2017.Google Scholar
  7. 58.
    David W. Matula. Determining edge connectivity in 0(nm). In Proc. of FOCS’87, 1987.Google Scholar
  8. 61.
    Michael Mitzenmacher and Eli Upfal. Probability and computing - randomized algorithms and probabilistic analysis. Cambridge University Press, 2005.Google Scholar
  9. 66.
    Apostolos N. Papadopoulos, Apostolos Lyritsis, and Yannis Manolopoulos. Skygraph: an algorithm for important subgraph discovery in relational graphs. Data Min. Knowl. Discov., 17(1), August 2008.Google Scholar
  10. 85.
    Mechthild Stoer and Frank Wagner. A simple min-cut algorithm. J. ACM, 44(4), 1997.Google Scholar
  11. 94.
    Dong Wen, Lu Qin, Xuemin Lin, Ying Zhang, and Lijun Chang. Enumerating k-vertex connected components in large graphs. CoRR, abs/1703.08668, 2017.Google Scholar
  12. 98.
    Xifeng Yan, X. Jasmine Zhou, and Jiawei Han. Mining closed relational graphs with connectivity constraints. In Proc. of KDD’05, 2005.Google Scholar
  13. 100.
    Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, and Wenjie Zhang. I/O efficient ECC graph decomposition via graph reduction. VLDB J., 26(2):275–300, 2017.CrossRefGoogle Scholar
  14. 102.
    Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang, Baichen Chen, and Jianxin Li. Finding maximal k-edge-connected subgraphs from a large graph. In Proc. of EDBT’12, 2012.Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Lijun Chang
    • 1
  • Lu Qin
    • 2
  1. 1.School of Computer ScienceThe University of SydneySydneyAustralia
  2. 2.Centre for Artificial IntelligenceUniversity of Technology SydneySydneyAustralia

Personalised recommendations