Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A Combinatorial Model of Two-Sided Search

From MaRDI portal
Publication:5890524
Jump to:navigation, search

DOI10.1007/978-3-662-49192-8_12zbMath1397.68130OpenAlexW2295894020MaRDI QIDQ5890524

Ferdinando Cicalese, 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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (2)

Search for a moving element with the minimum total cardinality of tests ⋮ Search for a moving target in a graph




This page was built for publication: A Combinatorial Model of Two-Sided Search

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5890524&oldid=15688853"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 17:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki