"Efficiently computing k-edge connected components via graph decomposition."

Lijun Chang et al. (2013)

> Home

Details and statistics

DOI: 10.1145/2463676.2465323

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/sigmod/ChangYQLLL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigmod/ChangYQLLL13
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, Weifa Liang:
Efficiently computing k-edge connected components via graph decomposition. SIGMOD Conference 2013: 205-216

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.