Parameterized Complexity of Maximum Edge Colorable Subgraph

Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh 0001, Prafullkumar Tale. Parameterized Complexity of Maximum Edge Colorable Subgraph. In Donghyun Kim 0001, R. N. Uma, Zhipeng Cai 0001, Dong Hoon Lee 0001, editors, Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings. Volume 12273 of Lecture Notes in Computer Science, pages 615-626, Springer, 2020. [doi]

Abstract

Abstract is missing.