Efficiently Computing k-Edge Connected Components via Graph Decomposition

Citation

Chang, L, Yu, J, Qin, L et al 2013, 'Efficiently Computing k-Edge Connected Components via Graph Decomposition', International Conference on Management of Data ACM SIGMOD/PODS 2013, ed. K.Ross, D Srivastava, D Papdias, Association for Computing Machinery (ACM), New York, USA, pp. 205-226.

Year

2013

ANU Authors

Fields of Research

  • Analysis Of Algorithms And Complexity
  • Networking And Communications

Updated:  13 November 2019 / Responsible Officer:  Director (Research Services Division) / Page Contact:  Researchers