Upper Bounds and Algorithms for Parallel Knock-Out Numbers
暂无分享,去创建一个
[1] Iain A. Stewart,et al. The Computational Complexity of the Parallel Knock-Out Problem , 2006, LATIN.
[2] Gerhard J. Woeginger,et al. Eliminating graphs by means of parallel knock-out schemes , 2007, Discret. Appl. Math..
[3] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .
[4] Zdenek Ryjácek,et al. Claw-free graphs - A survey , 1997, Discret. Math..
[5] Gerhard J. Woeginger,et al. Parallel Knock-Out Schemes in Networks , 2004, MFCS.
[6] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[7] Michael R. Fellows,et al. On the complexity and combinatorics of covering finite complexes , 1991, Australas. J Comb..
[8] Jan Kratochvíl,et al. Covering Regular Graphs , 1997, J. Comb. Theory B.
[9] Aviezri S. Fraenkel,et al. Combinatorial Games: selected Bibliography with a Succinct Gourmet Introduction , 2012 .
[10] Peter J. Slater,et al. PARALLEL KNOCKOUTS IN THE COMPLETE GRAPH , 1998 .