Vertex Cover Gets Faster and Harder on Low Degree Graphs

Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra. Vertex Cover Gets Faster and Harder on Low Degree Graphs. In Zhipeng Cai, Alex Zelikovsky, Anu G. Bourgeois, editors, Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings. Volume 8591 of Lecture Notes in Computer Science, pages 179-190, Springer, 2014. [doi]

Abstract

Abstract is missing.