Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
Crossref DOI link: https://doi.org/10.1007/s00453-018-0431-8
Published Online: 2018-04-05
Published Print: 2019-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Misra, Neeldhara
Panolan, Fahad
Rai, Ashutosh
Raman, Venkatesh
Saurabh, Saket
Funding for this research was provided by:
European Research Council (306992)
Text and Data Mining valid from 2018-04-05
Article History
Received: 10 May 2016
Accepted: 19 March 2018
First Online: 5 April 2018