Locating a robber with multiple probes (Q2411615): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2742357320 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.06482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Pursuit-Evasion in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a princess in a palace: a pursuit-evasion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a robber on a graph via distance queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers in graphs with large girth and Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evasion game on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robber locating game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivisions in the robber locating game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cop vs. gambler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recontamination does not help to search a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a robber on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3190837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a backtracking robber on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank

Latest revision as of 14:31, 14 July 2024

scientific article
Language Label Description Also known as
English
Locating a robber with multiple probes
scientific article

    Statements

    Locating a robber with multiple probes (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2017
    0 references
    graph searching
    0 references
    cops and robbers
    0 references
    subdivision
    0 references
    bounded-degree graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references