A combinatorial model of two-sided search

DOI10.1007/978-3-662-49192-8_12MaRDI QIDQ5890524zbMATH OpenOpenAlexFDO

Authors Harout Aydinian, Christian Deppe, Vladimir Lebedev

Publication date 10 March 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49192-8_12

Mathematics Subject Classification ID

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

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
• A search problem on graphs which generalizes some group testing problems with two defectives
• Searching for an edge in a graph with restricted test sets

Cited in

(6)

• Search for a moving target in a graph
• 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
• 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 Q5890524)