External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Finding maximal k-edge-connected subgraphs from a large graph

Rui Zhou 0001, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang, Baichen Chen, Jianxin Li. Finding maximal k-edge-connected subgraphs from a large graph. In Elke A. Rundensteiner, Volker Markl, Ioana Manolescu, Sihem Amer-Yahia, Felix Naumann, Ismail Ari, editors, 15th International Conference on Extending Database Technology, EDBT '12, Berlin, Germany, March 27-30, 2012, Proceedings. pages 480-491, ACM, 2012. [doi]

Authors

Rui Zhou 0001

This author has not been identified. Look up 'Rui Zhou 0001' in Google

Chengfei Liu

This author has not been identified. Look up 'Chengfei Liu' in Google

Jeffrey Xu Yu

This author has not been identified. Look up 'Jeffrey Xu Yu' in Google

Weifa Liang

This author has not been identified. Look up 'Weifa Liang' in Google

Baichen Chen

This author has not been identified. Look up 'Baichen Chen' in Google

Jianxin Li

This author has not been identified. Look up 'Jianxin Li' in Google
runs on