Pages that link to "Item:Q5286162"
From MaRDI portal
The following pages link to Recontamination does not help to search a graph (Q5286162):
Displaying 50 items.
- Network decontamination with a single agent (Q292259) (← links)
- Contraction obstructions for connected graph searching (Q298950) (← links)
- On the monotonicity of process number (Q299059) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- On minimum cost edge searching (Q391138) (← links)
- Fast-mixed searching and related problems on graphs (Q393051) (← links)
- Fast searching games on graphs (Q411259) (← links)
- Edge search number of cographs (Q415273) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- Fast edge searching and fast searching on graphs (Q631784) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Connected graph searching (Q690489) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- A property of random walks on a cycle graph (Q740121) (← links)
- On minimizing width in linear layouts (Q751660) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- Strong-mixed searching and pathwidth (Q867027) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- Monotonicity in digraph search problems (Q955030) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- A graph search algorithm for indoor pursuit/evasion (Q970034) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Maximum vertex occupation time and inert fugitive: Recontamination does help (Q987778) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Graph searching with advice (Q1008727) (← links)
- Edge searching weighted graphs (Q1026157) (← links)
- Sweeping graphs with large clique number (Q1045071) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Quickly excluding a forest (Q1179478) (← links)
- The vertex separation number of a graph equals its path-width (Q1198094) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- The capture time of a planar graph (Q1631664) (← links)
- How many lions are needed to clear a grid? (Q1662492) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- On the domination search number (Q1811076) (← links)
- Searching and pebbling (Q1821562) (← links)
- Directed tree-width (Q1850539) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
