Upper Bounds and Algorithms for Parallel Knock-Out Numbers

DOI10.1007/978-3-540-72951-8_26MaRDI QIDQ5425981zbMATH OpenOpenAlexFDO

Authors Matthew Johnson, Daniël Paulusma, Hajo Broersma

Publication date 15 November 2007

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL http://dro.dur.ac.uk/5468/1/5468.pdf

zbMATH Keywords

claw-free graphscomputational complexityparallel knock-out schemes

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Upper bounds and algorithms for parallel knock-out numbers
• Mathematical Foundations of Computer Science 2004
• Eliminating graphs by means of parallel knock-out schemes
• The Computational Complexity of the Parallel Knock-Out Problem
• Knocking out \(P_k\)-free graphs

Cited in

(10)

• Upper bounds and algorithms for parallel knock-out numbers
• Knocking out \(P_k\)-free graphs
• The computational complexity of the parallel knock-out problem
• Knocking out \(P _{k }\)-free graphs
• Path factors and parallel knock-out schemes of almost claw-free graphs
• The Computational Complexity of the Parallel Knock-Out Problem
• Parallel Knockouts in the Complete Graph
• Mathematical Foundations of Computer Science 2004
• Eliminating graphs by means of parallel knock-out schemes
• Path factors and parallel knock-out schemes of almost claw-free graphs

This page was built for publication: Upper Bounds and Algorithms for Parallel Knock-Out Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425981)