The following pages link to Monotonicity in graph searching (Q3974370):
Displaying 50 items.
- 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)
- Jumping robbers in digraphs (Q343927) (← 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)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- Exclusive graph searching (Q521823) (← links)
- The fast search number of a Cartesian product of graphs (Q526821) (← 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)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Strong-mixed searching and pathwidth (Q867027) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← 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)
- 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)
- Quickly excluding a forest (Q1179478) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Searching with mobile agents in networks with liars. (Q1422406) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- The capture time of a planar graph (Q1631664) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- On the domination search number (Q1811076) (← links)
- Directed tree-width (Q1850539) (← links)
- The localization capture time of a graph (Q2118876) (← links)
- Searching for an intruder on graphs and their subdivisions (Q2153405) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
