Pages that link to "Item:Q3777477"

The following pages link to The complexity of searching a graph (Q3777477):

Displaying 50 items.

• 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)
• Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
• The fast search number of a complete \(k\)-partite graph (Q1799234) (← links)
• Minimal trees of a given search number (Q1816287) (← links)
• Searching and pebbling (Q1821562) (← links)
• Directed tree-width (Q1850539) (← links)
• Approximate search strategies for weighted trees (Q1929222) (← links)
• Computing the one-visibility copnumber of trees (Q2039691) (← links)
• One-visibility cops and robber on trees: optimal cop-win strategies (Q2079862) (← links)
• Computing the one-visibility cop-win strategies for trees (Q2149861) (← links)
• One-visibility cops and robber on trees (Q2232598) (← links)
• Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
• Cooperative exploration and protection of a workspace assisted by information networks (Q2248545) (← links)
• Contiguous search problem in Sierpiński graphs (Q2272196) (← links)
• Characterization of graphs and digraphs with small process numbers (Q2275910) (← links)
• Complexity of node coverage games (Q2344734) (← links)
• Non-deterministic graph searching in trees (Q2344776) (← links)
• Linear rank-width and linear clique-width of trees (Q2346380) (← links)
• The searchlight problem for road networks (Q2354403) (← links)
• Distributed graph searching with a sense of direction (Q2355324) (← links)
• The cost of monotonicity in distributed graph searching (Q2377133) (← links)
• Locating a robber with multiple probes (Q2411615) (← links)
• Monotonicity of strong searching on digraphs (Q2426650) (← links)
• A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
• The theory of guaranteed search on graphs (Q2439841) (← links)
• Three-fast-searchable graphs (Q2446838) (← links)
• Node-searching problem on block graphs (Q2462351) (← links)
• Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (Q2583537) (← links)
• Fast searching on cactus graphs (Q2696935) (← links)
• The Complexity of the Positive Semidefinite Zero Forcing (Q2942442) (← links)
• Fast Searching on Complete k-partite Graphs (Q2958311) (← links)
• Fast Searching on Cartesian Products of Graphs (Q2988858) (← links)
• Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
• Robust shortest path planning and semicontractive dynamic programming (Q3120605) (← links)
• Decontamination of hypercubes by mobile agents (Q3184603) (← links)
• NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY (Q3444837) (← links)
• DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS (Q3444846) (← links)
• Pathwidth of outerplanar graphs (Q3445500) (← links)
• Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)
• Mixed Search Number of Permutation Graphs (Q3507333) (← links)
• Monotonicity of Non-deterministic Graph Searching (Q3508552) (← links)
• Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
• Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
• INTRUDER CAPTURING IN MESH AND TORUS NETWORKS (Q3526552) (← links)
• A variation on the min cut linear arrangement problem (Q3785979) (← links)
• (Q3989040) (← links)
• Searching expenditure and interval graphs (Q4242800) (← links)