A Combinatorial Model of Two-Sided Search
DOI10.1142/S0129054118410022zbMATH Open1397.68131OpenAlexW2809922841MaRDI QIDQ5895055FDOQ5895055
Authors: Harout Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir Lebedev 
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
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
Learning and adaptive systems in artificial intelligence (68T05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Title not available (Why is that?)
- An annotated bibliography on guaranteed graph searching
- Title not available (Why is that?)
- A group testing problem for hypergraphs of bounded rank
- Title not available (Why is that?)
- On search games that include ambush
- Graph-Constrained Group Testing
- Searching and sweeping graphs: a brief survey
- Title not available (Why is that?)
- Searching games with errors -- fifty years of coping with liars
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- A tight upper bound for group testing in graphs
Cited In (7)
- Binary search in graphs revisited
- Optimal strategies for a model of combinatorial two-sided search
- A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
- A combinatorial model of two-sided search
- Searching for an intruder on graphs and their subdivisions
- Non-adaptive and adaptive two-sided search with fast objects
- Search for a moving element with the minimum total cardinality of tests
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)
