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

Rui Zhou et al. (2012)

> Home

Details and statistics

DOI: 10.1145/2247596.2247652

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/edbt/ZhouLYLCL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/edbt/ZhouLYLCL12
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang, Baichen Chen, Jianxin Li:
Finding maximal k-edge-connected subgraphs from a large graph. EDBT 2012: 480-491

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.