Recommendations
- A combinatorial model of two-sided search
- Optimal strategies for a model of combinatorial two-sided search
- Combinatorial search in two and more rounds
- scientific article; zbMATH DE number 2084720
- scientific article; zbMATH DE number 41347
- Two-sided search and perfect segregation with fixed search costs
- Combinatorial search: from algorithms to systems
- scientific article; zbMATH DE number 1222833
- Some mathematical considerations on two-mode searching. II
- Publication:4865449
Cites work
- A group testing problem for hypergraphs of bounded rank
- A tight upper bound for group testing in graphs
- An annotated bibliography on guaranteed graph searching
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Graph-Constrained Group Testing
- scientific article; zbMATH DE number 4209901 (Why is no real title available?)
- scientific article; zbMATH DE number 3662840 (Why is no real title available?)
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- On search games that include ambush
- Searching and sweeping graphs: a brief survey
- Searching games with errors -- fifty years of coping with liars
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
Cited in
(8)- Binary search in graphs revisited
- Searching for an intruder on graphs and their subdivisions
- Search for a moving element with the minimum total cardinality of tests
- Binary search in graphs revisited
- A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
- Optimal strategies for a model of combinatorial two-sided search
- A combinatorial model of two-sided search
- Non-adaptive and adaptive two-sided search with fast objects
This page was built for publication: A Combinatorial Model of Two-Sided Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895055)
