Pages that link to "Item:Q5286162"
From MaRDI portal
The following pages link to Recontamination does not help to search a graph (Q5286162):
Displaying 45 items.
- Lions and contamination, triangular grids, and Cheeger constants (Q2080095) (← links)
- The localization capture time of a graph (Q2118876) (← links)
- Searching for an intruder on graphs and their subdivisions (Q2153405) (← links)
- Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
- Cooperative exploration and protection of a workspace assisted by information networks (Q2248545) (← links)
- Contiguous search problem in Sierpiński graphs (Q2272196) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- Complexity of node coverage games (Q2344734) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- A robber locating strategy for trees (Q2410225) (← links)
- Locating a robber with multiple probes (Q2411615) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
- Three-fast-searchable graphs (Q2446838) (← links)
- Lower bounds on the pathwidth of some grid-like graphs (Q2476243) (← links)
- Lions and contamination: monotone clearings (Q2678261) (← links)
- Fast searching on cactus graphs (Q2696935) (← links)
- On the Capture Time of Cops and Robbers Game on a Planar Graph (Q2958299) (← links)
- When Is a Network Epidemic Hard to Eliminate? (Q2976137) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
- Decontamination of hypercubes by mobile agents (Q3184603) (← links)
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY (Q3444837) (← links)
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS (Q3444846) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Monotonicity of Non-deterministic Graph Searching (Q3508552) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- INTRUDER CAPTURING IN MESH AND TORUS NETWORKS (Q3526552) (← links)
- Searching expenditure and interval graphs (Q4242800) (← links)
- Graph automata for linear graph languages (Q4645286) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- On the Cooperative Graph Searching Problem (Q5056072) (← links)
- Visibility-based pursuit-evasion in a polygonal environment (Q5096922) (← links)
- Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)
- Integer programming models and algorithms for the graph decontamination problem with mobile agents (Q5326775) (← links)
- Searching by heterogeneous agents (Q5918998) (← links)
- On-line search in two-dimensional environment (Q5919296) (← links)
- Recognizing hyperelliptic graphs in polynomial time (Q5919531) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- Edge searching and fast searching with constraints (Q6122599) (← links)
- Graph searching on chordal graphs (Q6487435) (← links)
- Constrained graph searching on trees (Q6535820) (← links)
- The zero-visibility cops and robber game on graph products (Q6564028) (← links)
