Upper Bounds and Algorithms for Parallel Knock-Out Numbers

DOI10.1007/978-3-540-72951-8_26zbMath1201.05088OpenAlexW2177120687MaRDI QIDQ5425981

Matthew Johnson, Daniël Paulusma, Hajo J. 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

computational complexityclaw-free graphsparallel knock-out schemes

Mathematics Subject Classification ID

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

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