Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization

Wanru Gao, Tobias Friedrich 0001, Timo Kötzing, Frank Neumann. Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. In Wei Peng, Damminda Alahakoon, Xiaodong Li, editors, AI 2017: Advances in Artificial Intelligence - 30th Australasian Joint Conference, Melbourne, VIC, Australia, August 19-20, 2017, Proceedings. Volume 10400 of Lecture Notes in Computer Science, pages 131-143, Springer, 2017. [doi]

@inproceedings{Gao0KN17,
  title = {Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization},
  author = {Wanru Gao and Tobias Friedrich 0001 and Timo Kötzing and Frank Neumann},
  year = {2017},
  doi = {10.1007/978-3-319-63004-5_11},
  url = {https://doi.org/10.1007/978-3-319-63004-5_11},
  researchr = {https://researchr.org/publication/Gao0KN17},
  cites = {0},
  citedby = {0},
  pages = {131-143},
  booktitle = {AI 2017: Advances in Artificial Intelligence - 30th Australasian Joint Conference, Melbourne, VIC, Australia, August 19-20, 2017, Proceedings},
  editor = {Wei Peng and Damminda Alahakoon and Xiaodong Li},
  volume = {10400},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-63004-5},
}