Abstract
A parallel knock-out scheme for a graph proceeds in rounds in each of which each surviving vertex eliminates one of its surviving neighbours. A graph is KO-reducible if there exists such a scheme that eliminates every vertex in the graph. The Parallel Knock-Out problem is to decide whether a graph G is KO-reducible. This problem is known to be NP-complete and has been studied for several graph classes since MFCS 2004. We show that the problem is NP-complete even for split graphs, a subclass of P 5-free graphs. In contrast, our main result is that it is linear-time solvable for P 4-free graphs (cographs).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Brandstädt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)
Broersma, H.J., Fomin, F.V., Královič, R., Woeginger, G.J.: Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics 155, 92–102 (2007); See also Broersma, H., Fomin, F.V., Woeginger, G.J.: Parallel knock-out schemes in networks. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 204–214. Springer, Heidelberg (2004)
Broersma, H.J., Johnson, M., Paulusma, D., Stewart, I.A.: The computational complexity of the parallel knock-out problem. Theoretical Computer Science 393, 182–195 (2008)
Broersma, H.J., Johnson, M., Paulusma, D.: Upper bounds and algorithms for parallel knock-out numbers. Theoretical Computer Science 410, 1319–1327 (2008)
Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3, 163–174 (1981)
Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing 14, 926–934 (1985)
Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics 101, 77–144 (2000)
Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded Graphs in polynomial time. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 117–128. Springer, Heidelberg (2001)
Földes, S., Hammer, P.L.: Split graphs, 8th South–Eastern Conf. on Combinatorics. Graph Theory and Computing, Congressus Numerantium 19, 311–315 (1977)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)
Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. International Journal of Foundations of Computer Science 11, 423–443 (2000)
Johansson, O.: Clique-decomposition, NLC-decomposition, and modular decomposition – relationships and results for random graphs. Congressus Numerantium 132, 39–60 (1998)
Johnson, M., Paulusma, D., Wood, C.: Path factors and parallel knock-out schemes of almost claw-free graphs. Discrete Mathematics 310, 1413–1423 (2010)
Lampert, D.E., Slater, P.J.: Parallel knockouts in the complete graph. American Mathematical Monthly 105, 556–558 (1998)
Wanke, E.: k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics 54, 251–266 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johnson, M., Paulusma, D., Stewart, A. (2014). Knocking Out P k -free Graphs. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44465-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-662-44465-8_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44464-1
Online ISBN: 978-3-662-44465-8
eBook Packages: Computer ScienceComputer Science (R0)