"Scaling up Local Search for Minimum Vertex Cover in Large Graphs by ..."

Wanru Gao et al. (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-63004-5_11

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ausai/Gao0KN17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ausai/Gao0KN17
Wanru Gao, Tobias Friedrich, Timo Kötzing, Frank Neumann:
Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. Australasian Conference on Artificial Intelligence 2017: 131-143

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.