"Using an edge-dual graph and k-connectivity to identify strong ..."

Li Ding, Brandon Dixon (2008)

> Home

Details and statistics

DOI: 10.1145/1593105.1593230

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ACMse/DingD08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ACMse/DingD08
Li Ding, Brandon Dixon:
Using an edge-dual graph and k-connectivity to identify strong connections in social networks. ACM Southeast Regional Conference 2008: 475-480

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.