A Combinatorial Model of Two-Sided Search

DOI10.1007/978-3-662-49192-8_12zbMATH Open1397.68130OpenAlexW2295894020MaRDI QIDQ5890524FDOQ5890524

Author name not available (Why is that?), Harout Aydinian, Vladimir Lebedev, Christian Deppe

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

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

Cited In (4)

• A Combinatorial Model of Two-Sided Search
• A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
• Search for a moving target in a graph
• 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 Q5890524)