The following pages link to (Q4035355):
Displaying 50 items.
- Fast searching games on graphs (Q411259) (← links)
- Edge search number of cographs (Q415273) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Exclusive graph searching (Q521823) (← links)
- The fast search number of a Cartesian product of graphs (Q526821) (← links)
- Centroidal localization game (Q668034) (← links)
- Connected graph searching (Q690489) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- The role of information in the cop-robber game (Q930890) (← links)
- Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning (Q930894) (← 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)
- Connected graph searching in chordal graphs (Q967304) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Graph searching with advice (Q1008727) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← 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)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- How many lions are needed to clear a grid? (Q1662492) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- The fast search number of a complete \(k\)-partite graph (Q1799234) (← links)
- On the domination search number (Q1811076) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- Minimum rank and zero forcing number for butterfly networks (Q2424660) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- Lower bounds on the pathwidth of some grid-like graphs (Q2476243) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Fast searching on cactus graphs (Q2696935) (← links)
- Fast Searching on Complete k-partite Graphs (Q2958311) (← links)
- Fast Searching on Cartesian Products of Graphs (Q2988858) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- Searching expenditure and interval graphs (Q4242800) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- (Q5115814) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
