Rounds in combinatorial search

DOI10.1007/s00453-013-9750-yzbMath1275.68109OpenAlexW2051532473MaRDI QIDQ378259

Gábor Wiener

Publication date: 11 November 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2239/

zbMATH Keywords

adaptivitysearchgroup testingrounds

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics in computer science (68R05)

Related Items (7)

Deterministic versus randomized adaptive test cover ⋮ Separating families of convex sets ⋮ Randomized Adaptive Test Cover ⋮ Combinatorial search in two and more rounds ⋮ Edge Multiplicity and Other Trace Functions ⋮ Recognition problems and communication complexity. ⋮ Rounds in a combinatorial search problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long paths and cycles in hypercubes with faulty vertices
• Long paths in hypercubes with a quadratic number of faults
• On the density of sets of vectors
• On the trace of finite sets
• Another algebraic proof of Bondy's theorem on induced subsets
• Induced subsets
• Edge Multiplicity and Other Trace Functions
• Minimal completely separating systems

This page was built for publication: Rounds in combinatorial search