Finding Maximal k-Edge-Connected Subgraphs from a Large Graph

Citation

Zhou, R, Liu, C, Yu, J et al 2012, 'Finding Maximal k-Edge-Connected Subgraphs from a Large Graph', International Conference on Extending Database Technology (EDBT 2012), Conference Organising Committee, Berlin Germany, pp. 480-491.

Year

2012

ANU Authors

Fields of Research

  • Analysis Of Algorithms And Complexity
  • Information Systems Management

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