A Combinatorial Model of Two-Sided Search

DOI10.1142/S0129054118410022MaRDI QIDQ5895055zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

adaptive searchsearch in graphstwo-sided search

Mathematics Subject Classification ID

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

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

• 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?)
• 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
• 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)

• Searching for an intruder on graphs and their subdivisions
• Optimal strategies for a model of combinatorial two-sided search
• A combinatorial model of two-sided search
• Search for a moving element with the minimum total cardinality of tests
• A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
• Binary search in graphs revisited
• Non-adaptive and adaptive two-sided search with fast objects
• Binary search in graphs revisited

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)