Pages that link to "Item:Q3777477"
From MaRDI portal
The following pages link to The complexity of searching a graph (Q3777477):
Displaying 50 items.
- Network decontamination with a single agent (Q292259) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← 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)
- Capture bounds for visibility-based pursuit evasion (Q482339) (← 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)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← 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)
- The complexity of pursuit on a graph (Q673639) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Connected graph searching (Q690489) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- A property of random walks on a cycle graph (Q740121) (← links)
- On minimizing width in linear layouts (Q751660) (← links)
- Resource finding in store-and-forward networks (Q758183) (← 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)
- 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)
- Cleaning a network with brushes (Q930892) (← 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)
- Escaping offline searchers and isoperimetric theorems (Q955225) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- Parallel cleaning of a network with brushes (Q968165) (← links)
- A graph search algorithm for indoor pursuit/evasion (Q970034) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Graph searching with advice (Q1008727) (← links)
- Edge searching weighted graphs (Q1026157) (← links)
- Standard directed search strategies and their applications (Q1029267) (← links)
- Sweeping graphs with large clique number (Q1045071) (← links)
- On a pursuit game played on graphs for which a minor is excluded (Q1101027) (← links)
- Single step graph search problem (Q1183450) (← links)
- Search and sweep numbers of finite directed acyclic graphs (Q1208460) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- The summation and bottleneck minimization for single-step searching on weighted graphs (Q1310944) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
