A Combinatorial Model of Two-Sided Search

DOI10.1142/S0129054118410022zbMath1397.68131OpenAlexW2809922841MaRDI QIDQ5895055

Ferdinando Cicalese, Harout Aydinian, Vladimir Lebedev, Christian Deppe

Publication date: 24 July 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118410022

zbMATH Keywords

two-sided searchadaptive searchsearch in graphs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Searching for an intruder on graphs and their subdivisions ⋮ Search for a moving element with the minimum total cardinality of tests

Cites Work

• Fault-tolerant search algorithms. Reliable computation with unreliable information
• An annotated bibliography on guaranteed graph searching
• A tight upper bound for group testing in graphs
• A group testing problem for hypergraphs of bounded rank
• Graph-Constrained Group Testing
• On Search Games That Include Ambush
• Searching games with errors -- fifty years of coping with liars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Combinatorial Model of Two-Sided Search