"Efficient $K$-concern Matching in a Large Graph."

Lei Gai et al. (2018)

> Home

Details and statistics

DOI: 10.1109/FSKD.2018.8687149

access: closed

type: Conference or Workshop Paper

metadata version: 2019-04-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icnc/GaiLSW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icnc/GaiLSW18
Lei Gai, Jian Li, Jie Shang, Xiaoming Wang:
Efficient $K$-concern Matching in a Large Graph. ICNC-FSKD 2018: 190-196

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.