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

On some problems of guaranteed search on graphs

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

DOI10.3103/S1063454110020020zbMath1253.05103OpenAlexW2088438934MaRDI QIDQ1759547

Xianqiang Yang

Publication date: 21 November 2012

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1063454110020020


zbMATH Keywords

evaderGolovach functionsearch numbersunit jumps\(\varepsilon \)-captureguaranteed searchteam of pursuers


Mathematics Subject Classification ID

Searching and sorting (68P10) Differential games (aspects of game theory) (91A23) Combinatorics on words (68R15) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)


Related Items (3)

The realizability problem for Golovach-type functions ⋮ Monotonicity of the search number in the Golovach problem ⋮ The theory of guaranteed search on graphs




Cites Work

  • An annotated bibliography on guaranteed graph searching




This page was built for publication: On some problems of guaranteed search on graphs

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