Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs

DOI10.1007/978-3-642-45043-3_32zbMath1417.05082MaRDI QIDQ2864316

Saket Saurabh, Venkatesh Raman, Fahad Panolan, Ashutosh Rai, Neeldhara Misra

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_32

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms

05C17: Perfect graphs