Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Wanru Gao' in GoogleThis author has not been identified. Look up 'Tobias Friedrich 0001' in GoogleThis author has not been identified. Look up 'Timo Kötzing' in GoogleThis author has not been identified. Look up 'Frank Neumann' in Google

runs on WebDSL