Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs

Mingyu Xiao, Shaowei Kou. Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs. In Jianxin Wang, Chee-Keng Yap, editors, Frontiers in Algorithmics - 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings. Volume 9130 of Lecture Notes in Computer Science, pages 282-293, Springer, 2015. [doi]

Abstract

Abstract is missing.