The computational complexity of the parallel knock-out problem
DOI10.1016/J.TCS.2007.11.021zbMATH Open1136.68028OpenAlexW2099339883MaRDI QIDQ2481963FDOQ2481963
Iain Stewart, Hajo Broersma, Daniël Paulusma, Matthew Johnson
Publication date: 15 April 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/5000/1/5000.pdf
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Factorization of Linear Graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Knockouts in the Complete Graph
- Eliminating graphs by means of parallel knock-out schemes
- Title not available (Why is that?)
Cited In (7)
- Анализ сложности алгоритма параллельного поиска “золотой” коллизии
- Path factors and parallel knock-out schemes of almost claw-free graphs
- Upper bounds and algorithms for parallel knock-out numbers
- Knocking out \(P_k\)-free graphs
- Black-box Complexity of Parallel Search with Distributed Populations
- The Computational Complexity of the Parallel Knock-Out Problem
- Mathematical Foundations of Computer Science 2004
This page was built for publication: The computational complexity of the parallel knock-out problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481963)
