Pages that link to "Item:Q2481963"
From MaRDI portal
The following pages link to The computational complexity of the parallel knock-out problem (Q2481963):
Displaying 7 items.
- Eliminating graphs by means of parallel knock-out schemes (Q867852) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- Upper bounds and algorithms for parallel knock-out numbers (Q1008728) (← links)
- Knocking out \(P_k\)-free graphs (Q2352787) (← links)
- Black-box Complexity of Parallel Search with Distributed Populations (Q2981878) (← links)
- Анализ сложности алгоритма параллельного поиска “золотой” коллизии (Q5152407) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311097) (← links)