The following pages link to Searching and pebbling (Q1821562):
Displaying 50 items.
- Complexity and monotonicity results for domination games (Q266262) (← links)
- On the monotonicity of process number (Q299059) (← links)
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← 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 dag-width of directed graphs (Q444380) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← 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)
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- Fast edge searching and fast searching on graphs (Q631784) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← 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)
- Connected searching of weighted trees (Q719311) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- A property of random walks on a cycle graph (Q740121) (← 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)
- How to hunt an invisible rabbit on a graph (Q896060) (← 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)
- 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)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Edge searching weighted graphs (Q1026157) (← links)
- Standard directed search strategies and their applications (Q1029267) (← links)
- Sweeping graphs with large clique number (Q1045071) (← links)
- Interval graphs and searching (Q1059088) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Quickly excluding a forest (Q1179478) (← links)
- Narrowness, pathwidth, and their application in natural language processing (Q1186169) (← links)
- The vertex separation number of a graph equals its path-width (Q1198094) (← links)
- Search and sweep numbers of finite directed acyclic graphs (Q1208460) (← links)
