Network search games with immobile hider, without a designated searcher starting point (Q933761): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1231029
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Steven Alpern / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00182-008-0116-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028997157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hide-and-seek games on a tree to which Eulerian networks are attached / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search value of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating search at two locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search game on a network with immobile hider / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yet more on the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network search games, with arbitrary searcher starting point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online searching with turn cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: The absolute center of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part I: The Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of a simple strategy for searching graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games and other applications of game theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum diameter spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Differential Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SEARCH GAME WITH TRAVELING COST ON A TREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A search game on the union of graphs with immobile hider / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games with immobile hider / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of searching an immobile hider in a graph / rank
 
Normal rank

Revision as of 12:46, 28 June 2024

scientific article
Language Label Description Also known as
English
Network search games with immobile hider, without a designated searcher starting point
scientific article

    Statements

    Network search games with immobile hider, without a designated searcher starting point (English)
    0 references
    0 references
    0 references
    0 references
    25 July 2008
    0 references
    Search game
    0 references
    Network
    0 references
    Zero-sum
    0 references
    Chinese postman
    0 references
    Eulerian
    0 references

    Identifiers