Advertisement

Upper Bounds and Algorithms for Parallel Knock-Out Numbers

  • Hajo Broersma
  • Matthew Johnson
  • Daniël Paulusma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4474)

Abstract

We study parallel knock-out schemes for graphs. These schemes proceed in rounds in each of which each surviving vertex simultaneously eliminates one of its surviving neighbours; a graph is reducible if such a scheme can eliminate every vertex in the graph. We show that, for a reducible graph G, the minimum number of required rounds is \(O{({\sqrt{\alpha}})}\), where α is the independence number of G. This upper bound is tight and the result implies the square-root conjecture which was first posed in MFCS 2004. We also show that for reducible K 1,p -free graphs at most p − 1 rounds are required. It is already known that the problem of whether a given graph is reducible is NP-complete. For claw-free graphs, however, we show that this problem can be solved in polynomial time.

Keywords

parallel knock-out schemes claw-free graphs computational complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London (1976)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Broersma, H., et al.: Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics 155, 92–102 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Broersma, H., et al.: The computational complexity of the parallel knock-out problem. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 250–261. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Faudree, R., Flandrin, E., Ryjáček, Z.: Claw-free graphs—a survey. Discrete Mathematics 164, 87–147 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Fraenkel, A.S.: Combinatorial games: selected bibliography with a succinct gourmet introduction. Electronic Journal of Combinatorics (2007), http://www.emis.ams.org/journals/EJC/Surveys/ds2.pdf
  7. 7.
    Lampert, D.E., Slater, P.J.: Parallel knockouts in the complete graph. American Mathematical Monthly 105, 556–558 (1998)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Hajo Broersma
    • 1
  • Matthew Johnson
    • 1
  • Daniël Paulusma
    • 1
  1. 1.Department of Computer Science, Durham University, Science Laboratories, South Road, Durham DH1 3LEU.K.

Personalised recommendations